{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4JDUKCZUSDEVXBXR4DN3IRLYFU","short_pith_number":"pith:4JDUKCZU","schema_version":"1.0","canonical_sha256":"e247450b3490c95b86f1e0dbb445782d2fe20eab42696da9f41fd2f9f8a9f30b","source":{"kind":"arxiv","id":"1702.04707","version":2},"attestation_state":"computed","paper":{"title":"Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg, Pascal Giard","submitted_at":"2017-02-15T18:34:17Z","abstract_excerpt":"Polar codes are a recently proposed family of provably capacity-achieving error-correction codes that received a lot of attention. While their theoretical properties render them interesting, their practicality compared to other types of codes has not been thoroughly studied. Towards this end, in this paper, we perform a comparison of polar decoders against LDPC and Turbo decoders that are used in existing communications standards. More specifically, we compare both the error-correction performance and the hardware efficiency of the corresponding hardware implementations. This comparison enable"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1702.04707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-15T18:34:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e0acda1bc6a009587fca856d9b00844798df8c3ba5f70a0bda227f03f5e14371","abstract_canon_sha256":"748d85a5a8330fa493c8298a6065600fd99177af835c7d8516081d7968d36a4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:51.568494Z","signature_b64":"aSqJmT1CjTDIEWpyj5PLHCDY3zAO/JVwcv06lgYEaImUIadYiNs5qfZYYMij4Q78EscLhuVGjq6+VNtqsvXLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e247450b3490c95b86f1e0dbb445782d2fe20eab42696da9f41fd2f9f8a9f30b","last_reissued_at":"2026-05-18T00:44:51.568060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:51.568060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg, Pascal Giard","submitted_at":"2017-02-15T18:34:17Z","abstract_excerpt":"Polar codes are a recently proposed family of provably capacity-achieving error-correction codes that received a lot of attention. While their theoretical properties render them interesting, their practicality compared to other types of codes has not been thoroughly studied. Towards this end, in this paper, we perform a comparison of polar decoders against LDPC and Turbo decoders that are used in existing communications standards. More specifically, we compare both the error-correction performance and the hardware efficiency of the corresponding hardware implementations. This comparison enable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04707","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.04707","created_at":"2026-05-18T00:44:51.568126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04707v2","created_at":"2026-05-18T00:44:51.568126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04707","created_at":"2026-05-18T00:44:51.568126+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JDUKCZUSDEV","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JDUKCZUSDEVXBXR","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JDUKCZU","created_at":"2026-05-18T12:31:00.734936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4JDUKCZUSDEVXBXR4DN3IRLYFU","json":"https://pith.science/pith/4JDUKCZUSDEVXBXR4DN3IRLYFU.json","graph_json":"https://pith.science/api/pith-number/4JDUKCZUSDEVXBXR4DN3IRLYFU/graph.json","events_json":"https://pith.science/api/pith-number/4JDUKCZUSDEVXBXR4DN3IRLYFU/events.json","paper":"https://pith.science/paper/4JDUKCZU"},"agent_actions":{"view_html":"https://pith.science/pith/4JDUKCZUSDEVXBXR4DN3IRLYFU","download_json":"https://pith.science/pith/4JDUKCZUSDEVXBXR4DN3IRLYFU.json","view_paper":"https://pith.science/paper/4JDUKCZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04707&json=true","fetch_graph":"https://pith.science/api/pith-number/4JDUKCZUSDEVXBXR4DN3IRLYFU/graph.json","fetch_events":"https://pith.science/api/pith-number/4JDUKCZUSDEVXBXR4DN3IRLYFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JDUKCZUSDEVXBXR4DN3IRLYFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JDUKCZUSDEVXBXR4DN3IRLYFU/action/storage_attestation","attest_author":"https://pith.science/pith/4JDUKCZUSDEVXBXR4DN3IRLYFU/action/author_attestation","sign_citation":"https://pith.science/pith/4JDUKCZUSDEVXBXR4DN3IRLYFU/action/citation_signature","submit_replication":"https://pith.science/pith/4JDUKCZUSDEVXBXR4DN3IRLYFU/action/replication_record"}},"created_at":"2026-05-18T00:44:51.568126+00:00","updated_at":"2026-05-18T00:44:51.568126+00:00"}