{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UILB76P4M5J53OGC6M32DDPPLX","short_pith_number":"pith:UILB76P4","schema_version":"1.0","canonical_sha256":"a2161ff9fc6753ddb8c2f337a18def5dd6b4d00de0b55f6eeccaa4a6a6e0a39b","source":{"kind":"arxiv","id":"1501.01706","version":1},"attestation_state":"computed","paper":{"title":"Error Performance Analysis of the Symbol-Decision SC Polar Decoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chenrong Xiong, Jun Lin, Zhiyuan Yan","submitted_at":"2015-01-08T01:58:36Z","abstract_excerpt":"Polar codes are the first provably capacity-achieving forward error correction codes. To improve decoder throughput, the symbol-decision SC algorithm makes hard-decision for multiple bits at a time. In this paper, we prove that for polar codes, the symbol-decision SC algorithm is better than the bit-decision SC algorithm in terms of the frame error rate (FER) performance because the symbol-decision SC algorithm performs a local maximum likelihood decoding within a symbol. Moreover, the bigger the symbol size, the better the FER performance. Finally, simulation results over both the additive wh"},"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":"1501.01706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-08T01:58:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f9c457316dad3e326aeb70ec24eda6781a22b3bb64d7ad9788a0dae47e3af77c","abstract_canon_sha256":"8a8f137360d09fcd293b7a6ffa305867914cf3a05f91412f0ef30c08d44c2aec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:46.591281Z","signature_b64":"d11KawsLWJEeMXKH0GBdG9TXxlrUH8dUYPlIG7fVaJF+rgqjqma/GU5lWrAg5TaEJIvUpIgntdTKMPBQ3o+uAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2161ff9fc6753ddb8c2f337a18def5dd6b4d00de0b55f6eeccaa4a6a6e0a39b","last_reissued_at":"2026-05-18T02:29:46.590604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:46.590604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error Performance Analysis of the Symbol-Decision SC Polar Decoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chenrong Xiong, Jun Lin, Zhiyuan Yan","submitted_at":"2015-01-08T01:58:36Z","abstract_excerpt":"Polar codes are the first provably capacity-achieving forward error correction codes. To improve decoder throughput, the symbol-decision SC algorithm makes hard-decision for multiple bits at a time. In this paper, we prove that for polar codes, the symbol-decision SC algorithm is better than the bit-decision SC algorithm in terms of the frame error rate (FER) performance because the symbol-decision SC algorithm performs a local maximum likelihood decoding within a symbol. Moreover, the bigger the symbol size, the better the FER performance. Finally, simulation results over both the additive wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01706","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":"1501.01706","created_at":"2026-05-18T02:29:46.590718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01706v1","created_at":"2026-05-18T02:29:46.590718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01706","created_at":"2026-05-18T02:29:46.590718+00:00"},{"alias_kind":"pith_short_12","alias_value":"UILB76P4M5J5","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UILB76P4M5J53OGC","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UILB76P4","created_at":"2026-05-18T12:29:44.643036+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/UILB76P4M5J53OGC6M32DDPPLX","json":"https://pith.science/pith/UILB76P4M5J53OGC6M32DDPPLX.json","graph_json":"https://pith.science/api/pith-number/UILB76P4M5J53OGC6M32DDPPLX/graph.json","events_json":"https://pith.science/api/pith-number/UILB76P4M5J53OGC6M32DDPPLX/events.json","paper":"https://pith.science/paper/UILB76P4"},"agent_actions":{"view_html":"https://pith.science/pith/UILB76P4M5J53OGC6M32DDPPLX","download_json":"https://pith.science/pith/UILB76P4M5J53OGC6M32DDPPLX.json","view_paper":"https://pith.science/paper/UILB76P4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01706&json=true","fetch_graph":"https://pith.science/api/pith-number/UILB76P4M5J53OGC6M32DDPPLX/graph.json","fetch_events":"https://pith.science/api/pith-number/UILB76P4M5J53OGC6M32DDPPLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UILB76P4M5J53OGC6M32DDPPLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UILB76P4M5J53OGC6M32DDPPLX/action/storage_attestation","attest_author":"https://pith.science/pith/UILB76P4M5J53OGC6M32DDPPLX/action/author_attestation","sign_citation":"https://pith.science/pith/UILB76P4M5J53OGC6M32DDPPLX/action/citation_signature","submit_replication":"https://pith.science/pith/UILB76P4M5J53OGC6M32DDPPLX/action/replication_record"}},"created_at":"2026-05-18T02:29:46.590718+00:00","updated_at":"2026-05-18T02:29:46.590718+00:00"}