{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4P3A2Q2TGUL7CUDJBS76R7UKNY","short_pith_number":"pith:4P3A2Q2T","schema_version":"1.0","canonical_sha256":"e3f60d43533517f150690cbfe8fe8a6e0bc6eba050dd1db9bc21f46dfc9c877b","source":{"kind":"arxiv","id":"1604.05101","version":2},"attestation_state":"computed","paper":{"title":"FEC-Assisted Parallel Decoding of Polar Coded Frames: Design Considerations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eryk Dutkiewicz, Mohammad Sadegh Mohammadi, Qi Zhang","submitted_at":"2016-04-18T11:44:38Z","abstract_excerpt":"This paper deals with two main issues regarding the short polar codes: the potential of FEC-assisted decoding and optimal code concatenation strategies under various design scenarios. Code concatenation and FEC-assisted decoding are presented systematically, assuming a packetized system. It is shown that FEC-assisted decoding can improve frame error rate of successive cancellation decoding arbitrarily, at the expense of some coding rate loss and decoding complexity linearly increasing with the number of codewords in the frame. This is compared with list decoding whose complexity grows linearly"},"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":"1604.05101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-18T11:44:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5194e1bfb740a55328277fecb6e519a93ffaa4684d1e3f44cbd9fc1cdbfc5db1","abstract_canon_sha256":"de3581e4e7a1ee4a95c98c3803fe358330762f6b3157cadf63b5424216244fe1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:37.700300Z","signature_b64":"cryeko1hkY2t5xo4otWzSJgyQOuWwWavMdz1gQSNOrkyb+cO+u8329jXt2aoS7JvVCMvqHi0fewGJ++qinqbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3f60d43533517f150690cbfe8fe8a6e0bc6eba050dd1db9bc21f46dfc9c877b","last_reissued_at":"2026-05-18T01:10:37.699782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:37.699782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FEC-Assisted Parallel Decoding of Polar Coded Frames: Design Considerations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eryk Dutkiewicz, Mohammad Sadegh Mohammadi, Qi Zhang","submitted_at":"2016-04-18T11:44:38Z","abstract_excerpt":"This paper deals with two main issues regarding the short polar codes: the potential of FEC-assisted decoding and optimal code concatenation strategies under various design scenarios. Code concatenation and FEC-assisted decoding are presented systematically, assuming a packetized system. It is shown that FEC-assisted decoding can improve frame error rate of successive cancellation decoding arbitrarily, at the expense of some coding rate loss and decoding complexity linearly increasing with the number of codewords in the frame. This is compared with list decoding whose complexity grows linearly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05101","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":"1604.05101","created_at":"2026-05-18T01:10:37.699859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05101v2","created_at":"2026-05-18T01:10:37.699859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05101","created_at":"2026-05-18T01:10:37.699859+00:00"},{"alias_kind":"pith_short_12","alias_value":"4P3A2Q2TGUL7","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4P3A2Q2TGUL7CUDJ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4P3A2Q2T","created_at":"2026-05-18T12:29:58.707656+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/4P3A2Q2TGUL7CUDJBS76R7UKNY","json":"https://pith.science/pith/4P3A2Q2TGUL7CUDJBS76R7UKNY.json","graph_json":"https://pith.science/api/pith-number/4P3A2Q2TGUL7CUDJBS76R7UKNY/graph.json","events_json":"https://pith.science/api/pith-number/4P3A2Q2TGUL7CUDJBS76R7UKNY/events.json","paper":"https://pith.science/paper/4P3A2Q2T"},"agent_actions":{"view_html":"https://pith.science/pith/4P3A2Q2TGUL7CUDJBS76R7UKNY","download_json":"https://pith.science/pith/4P3A2Q2TGUL7CUDJBS76R7UKNY.json","view_paper":"https://pith.science/paper/4P3A2Q2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05101&json=true","fetch_graph":"https://pith.science/api/pith-number/4P3A2Q2TGUL7CUDJBS76R7UKNY/graph.json","fetch_events":"https://pith.science/api/pith-number/4P3A2Q2TGUL7CUDJBS76R7UKNY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4P3A2Q2TGUL7CUDJBS76R7UKNY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4P3A2Q2TGUL7CUDJBS76R7UKNY/action/storage_attestation","attest_author":"https://pith.science/pith/4P3A2Q2TGUL7CUDJBS76R7UKNY/action/author_attestation","sign_citation":"https://pith.science/pith/4P3A2Q2TGUL7CUDJBS76R7UKNY/action/citation_signature","submit_replication":"https://pith.science/pith/4P3A2Q2TGUL7CUDJBS76R7UKNY/action/replication_record"}},"created_at":"2026-05-18T01:10:37.699859+00:00","updated_at":"2026-05-18T01:10:37.699859+00:00"}