{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MAIOS4EFT4HHSBH7SMCJMIDQCV","short_pith_number":"pith:MAIOS4EF","schema_version":"1.0","canonical_sha256":"6010e970859f0e7904ff9304962070154bcd17fb50bb71fe5833e8d1420fbe39","source":{"kind":"arxiv","id":"1701.06111","version":1},"attestation_state":"computed","paper":{"title":"Polar Coding for Block Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Meixia Tao, Mengfan Zheng, Wen Chen","submitted_at":"2017-01-22T02:06:52Z","abstract_excerpt":"In this paper, we consider the problem of polar coding for block fading channels, with emphasis on those with instantaneous channel state information (CSI) at neither the transmitter nor the receiver. Our approach is to decompose a block fading channel of $T_c$ symbols per coherent interval into $T_c$ binary-input sub-channels in a capacity-preserving way, and design a polar code for each of them. For the case when instantaneous CSI is available at the receiver, a random interleaver can be used to enable joint encoding and decoding of all sub-channels so as to enhance the finite length perform"},"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":"1701.06111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-22T02:06:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9d516215d0ff4bb8f30cd0a6173e1555d6767bf6380111a63d5bde30f5dbec51","abstract_canon_sha256":"f59b46ba4656f65e6dee78929cc69657a23aa6022e2d0c716e1564214704763a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:19.283449Z","signature_b64":"MTOk9dhcBRVLL3KCnRsbZ6xeywu6Nx4cjGAJVauI+DAqbACcJYYmL5lQOD9NuZ9AT4NlE2W9TgUFe2KRMIm0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6010e970859f0e7904ff9304962070154bcd17fb50bb71fe5833e8d1420fbe39","last_reissued_at":"2026-05-18T00:52:19.282905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:19.282905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polar Coding for Block Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Meixia Tao, Mengfan Zheng, Wen Chen","submitted_at":"2017-01-22T02:06:52Z","abstract_excerpt":"In this paper, we consider the problem of polar coding for block fading channels, with emphasis on those with instantaneous channel state information (CSI) at neither the transmitter nor the receiver. Our approach is to decompose a block fading channel of $T_c$ symbols per coherent interval into $T_c$ binary-input sub-channels in a capacity-preserving way, and design a polar code for each of them. For the case when instantaneous CSI is available at the receiver, a random interleaver can be used to enable joint encoding and decoding of all sub-channels so as to enhance the finite length perform"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06111","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":"1701.06111","created_at":"2026-05-18T00:52:19.282990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06111v1","created_at":"2026-05-18T00:52:19.282990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06111","created_at":"2026-05-18T00:52:19.282990+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAIOS4EFT4HH","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAIOS4EFT4HHSBH7","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAIOS4EF","created_at":"2026-05-18T12:31:31.346846+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/MAIOS4EFT4HHSBH7SMCJMIDQCV","json":"https://pith.science/pith/MAIOS4EFT4HHSBH7SMCJMIDQCV.json","graph_json":"https://pith.science/api/pith-number/MAIOS4EFT4HHSBH7SMCJMIDQCV/graph.json","events_json":"https://pith.science/api/pith-number/MAIOS4EFT4HHSBH7SMCJMIDQCV/events.json","paper":"https://pith.science/paper/MAIOS4EF"},"agent_actions":{"view_html":"https://pith.science/pith/MAIOS4EFT4HHSBH7SMCJMIDQCV","download_json":"https://pith.science/pith/MAIOS4EFT4HHSBH7SMCJMIDQCV.json","view_paper":"https://pith.science/paper/MAIOS4EF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06111&json=true","fetch_graph":"https://pith.science/api/pith-number/MAIOS4EFT4HHSBH7SMCJMIDQCV/graph.json","fetch_events":"https://pith.science/api/pith-number/MAIOS4EFT4HHSBH7SMCJMIDQCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAIOS4EFT4HHSBH7SMCJMIDQCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAIOS4EFT4HHSBH7SMCJMIDQCV/action/storage_attestation","attest_author":"https://pith.science/pith/MAIOS4EFT4HHSBH7SMCJMIDQCV/action/author_attestation","sign_citation":"https://pith.science/pith/MAIOS4EFT4HHSBH7SMCJMIDQCV/action/citation_signature","submit_replication":"https://pith.science/pith/MAIOS4EFT4HHSBH7SMCJMIDQCV/action/replication_record"}},"created_at":"2026-05-18T00:52:19.282990+00:00","updated_at":"2026-05-18T00:52:19.282990+00:00"}