{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UG5CATHBH4FXTBWLQ6WHK36VTZ","short_pith_number":"pith:UG5CATHB","schema_version":"1.0","canonical_sha256":"a1ba204ce13f0b7986cb87ac756fd59e528e5c13a0a3ec36f0ffd75f261a4d46","source":{"kind":"arxiv","id":"1404.3001","version":1},"attestation_state":"computed","paper":{"title":"Joint Successive Cancellation Decoding of Polar Codes over Intersymbol Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Rongke Liu, Runxin Wang, Yi Hou","submitted_at":"2014-04-11T04:53:16Z","abstract_excerpt":"Polar codes are a class of capacity-achieving codes for the binary-input discrete memoryless channels (B-DMCs). However, when applied in channels with intersymbol interference (ISI), the codes may perform poorly with BCJR equalization and conventional decoding methods. To deal with the ISI problem, in this paper a new joint successive cancellation (SC) decoding algorithm is proposed for polar codes in ISI channels, which combines the equalization and conventional decoding. The initialization information of the decoding method is the likelihood functions of ISI codeword symbols rather than the "},"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":"1404.3001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-11T04:53:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d8ec301c2f8ca8becf11b4587a7dca5855b516d57042df8290e07c32e32216c7","abstract_canon_sha256":"ed98f199bbcd65eb332b98b74f2c4a85a84a57c130898740bce2ee1b7c0e631d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:22.668236Z","signature_b64":"Dbh47n0V+1IbdWGH4UW8Clkvr23kLnNt5iE+wcAc2ZySlan4UCDLsxvJq/aID0HWn8J6zqQ3Nd9FUcxpL6nqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1ba204ce13f0b7986cb87ac756fd59e528e5c13a0a3ec36f0ffd75f261a4d46","last_reissued_at":"2026-05-18T02:54:22.667728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:22.667728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Successive Cancellation Decoding of Polar Codes over Intersymbol Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Rongke Liu, Runxin Wang, Yi Hou","submitted_at":"2014-04-11T04:53:16Z","abstract_excerpt":"Polar codes are a class of capacity-achieving codes for the binary-input discrete memoryless channels (B-DMCs). However, when applied in channels with intersymbol interference (ISI), the codes may perform poorly with BCJR equalization and conventional decoding methods. To deal with the ISI problem, in this paper a new joint successive cancellation (SC) decoding algorithm is proposed for polar codes in ISI channels, which combines the equalization and conventional decoding. The initialization information of the decoding method is the likelihood functions of ISI codeword symbols rather than the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3001","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":"1404.3001","created_at":"2026-05-18T02:54:22.667799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3001v1","created_at":"2026-05-18T02:54:22.667799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3001","created_at":"2026-05-18T02:54:22.667799+00:00"},{"alias_kind":"pith_short_12","alias_value":"UG5CATHBH4FX","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UG5CATHBH4FXTBWL","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UG5CATHB","created_at":"2026-05-18T12:28:52.271510+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/UG5CATHBH4FXTBWLQ6WHK36VTZ","json":"https://pith.science/pith/UG5CATHBH4FXTBWLQ6WHK36VTZ.json","graph_json":"https://pith.science/api/pith-number/UG5CATHBH4FXTBWLQ6WHK36VTZ/graph.json","events_json":"https://pith.science/api/pith-number/UG5CATHBH4FXTBWLQ6WHK36VTZ/events.json","paper":"https://pith.science/paper/UG5CATHB"},"agent_actions":{"view_html":"https://pith.science/pith/UG5CATHBH4FXTBWLQ6WHK36VTZ","download_json":"https://pith.science/pith/UG5CATHBH4FXTBWLQ6WHK36VTZ.json","view_paper":"https://pith.science/paper/UG5CATHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3001&json=true","fetch_graph":"https://pith.science/api/pith-number/UG5CATHBH4FXTBWLQ6WHK36VTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UG5CATHBH4FXTBWLQ6WHK36VTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UG5CATHBH4FXTBWLQ6WHK36VTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UG5CATHBH4FXTBWLQ6WHK36VTZ/action/storage_attestation","attest_author":"https://pith.science/pith/UG5CATHBH4FXTBWLQ6WHK36VTZ/action/author_attestation","sign_citation":"https://pith.science/pith/UG5CATHBH4FXTBWLQ6WHK36VTZ/action/citation_signature","submit_replication":"https://pith.science/pith/UG5CATHBH4FXTBWLQ6WHK36VTZ/action/replication_record"}},"created_at":"2026-05-18T02:54:22.667799+00:00","updated_at":"2026-05-18T02:54:22.667799+00:00"}