{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:24TRZG524CRGTGSVVPAHCLOBY7","short_pith_number":"pith:24TRZG52","schema_version":"1.0","canonical_sha256":"d7271c9bbae0a2699a55abc0712dc1c7dba921998392491549332aebbaf909ed","source":{"kind":"arxiv","id":"1208.3091","version":1},"attestation_state":"computed","paper":{"title":"An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Li, David Tse, Hui Shen","submitted_at":"2012-08-15T11:05:53Z","abstract_excerpt":"In this letter, we propose an adaptive SC (Successive Cancellation)-List decoder for polar codes with CRC. This adaptive SC-List decoder iteratively increases the list size until the decoder outputs contain at least one survival path which can pass CRC. Simulation shows that the adaptive SC-List decoder provides significant complexity reduction. We also demonstrate that polar code (2048, 1024) with 24-bit CRC decoded by our proposed adaptive SC-List decoder with very large list size can achieve a frame error rate FER=0.001 at Eb/No=1.1dB, which is about 0.2dB from the information theoretic lim"},"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":"1208.3091","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2012-08-15T11:05:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3a9542496c0002dd36f7202130c3e2905df9765560afc88029a2ee4efc1e2da1","abstract_canon_sha256":"10f449d3cddc05b3022fe5465f9cfc0bdc5279a1d531eec4ab2ead55fd360858"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:45.579782Z","signature_b64":"gmsM3qL2u1Ai/i7UkHnA/9ROQ1JDoaUCNcKXgccDNsN0d7NrcaLvyIErc4UGR/qZxacIWOhb7fW1DDTfooGyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7271c9bbae0a2699a55abc0712dc1c7dba921998392491549332aebbaf909ed","last_reissued_at":"2026-05-18T03:48:45.578947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:45.578947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Li, David Tse, Hui Shen","submitted_at":"2012-08-15T11:05:53Z","abstract_excerpt":"In this letter, we propose an adaptive SC (Successive Cancellation)-List decoder for polar codes with CRC. This adaptive SC-List decoder iteratively increases the list size until the decoder outputs contain at least one survival path which can pass CRC. Simulation shows that the adaptive SC-List decoder provides significant complexity reduction. We also demonstrate that polar code (2048, 1024) with 24-bit CRC decoded by our proposed adaptive SC-List decoder with very large list size can achieve a frame error rate FER=0.001 at Eb/No=1.1dB, which is about 0.2dB from the information theoretic lim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3091","kind":"arxiv","version":1},"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":"1208.3091","created_at":"2026-05-18T03:48:45.579077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.3091v1","created_at":"2026-05-18T03:48:45.579077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3091","created_at":"2026-05-18T03:48:45.579077+00:00"},{"alias_kind":"pith_short_12","alias_value":"24TRZG524CRG","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"24TRZG524CRGTGSV","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"24TRZG52","created_at":"2026-05-18T12:26:50.516681+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/24TRZG524CRGTGSVVPAHCLOBY7","json":"https://pith.science/pith/24TRZG524CRGTGSVVPAHCLOBY7.json","graph_json":"https://pith.science/api/pith-number/24TRZG524CRGTGSVVPAHCLOBY7/graph.json","events_json":"https://pith.science/api/pith-number/24TRZG524CRGTGSVVPAHCLOBY7/events.json","paper":"https://pith.science/paper/24TRZG52"},"agent_actions":{"view_html":"https://pith.science/pith/24TRZG524CRGTGSVVPAHCLOBY7","download_json":"https://pith.science/pith/24TRZG524CRGTGSVVPAHCLOBY7.json","view_paper":"https://pith.science/paper/24TRZG52","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.3091&json=true","fetch_graph":"https://pith.science/api/pith-number/24TRZG524CRGTGSVVPAHCLOBY7/graph.json","fetch_events":"https://pith.science/api/pith-number/24TRZG524CRGTGSVVPAHCLOBY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24TRZG524CRGTGSVVPAHCLOBY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24TRZG524CRGTGSVVPAHCLOBY7/action/storage_attestation","attest_author":"https://pith.science/pith/24TRZG524CRGTGSVVPAHCLOBY7/action/author_attestation","sign_citation":"https://pith.science/pith/24TRZG524CRGTGSVVPAHCLOBY7/action/citation_signature","submit_replication":"https://pith.science/pith/24TRZG524CRGTGSVVPAHCLOBY7/action/replication_record"}},"created_at":"2026-05-18T03:48:45.579077+00:00","updated_at":"2026-05-18T03:48:45.579077+00:00"}