{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QD3OL5CHVLBFQL3RWN2JXAST6H","short_pith_number":"pith:QD3OL5CH","schema_version":"1.0","canonical_sha256":"80f6e5f447aac2582f71b3749b8253f1d7c3c8ba39fc8a8e35598c4b5a897b07","source":{"kind":"arxiv","id":"1010.5278","version":2},"attestation_state":"computed","paper":{"title":"Analysis and Design of Tuned Turbo Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Christian Koller, Daniel J. Costello Jr, Francesca Vatta, Joerg Kliewer, Kamil S. Zigangirov","submitted_at":"2010-10-25T22:39:09Z","abstract_excerpt":"It has been widely observed that there exists a fundamental trade-off between the minimum (Hamming) distance properties and the iterative decoding convergence behavior of turbo-like codes. While capacity achieving code ensembles typically are asymptotically bad in the sense that their minimum distance does not grow linearly with block length, and they therefore exhibit an error floor at moderate-to-high signal to noise ratios, asymptotically good codes usually converge further away from channel capacity. In this paper, we introduce the concept of tuned turbo codes, a family of asymptotically g"},"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":"1010.5278","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-25T22:39:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3643b0227dc02f85e768606960d859e2ee2c0df085a785dc63bce2456fc5dafb","abstract_canon_sha256":"77f3c6c1486e7982aa06e7dd57cd0ebdb5fcb763cce48513f754f42935fe06eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:08.698431Z","signature_b64":"xqdA3UOWxOcHCByvv7k3yHNZisSVHEFCQvDM2FQ/c1teO1eKV+JOE2FpPGrmcvcuOq7igm2u6MQ10W42W0VQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80f6e5f447aac2582f71b3749b8253f1d7c3c8ba39fc8a8e35598c4b5a897b07","last_reissued_at":"2026-05-18T03:56:08.697727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:08.697727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis and Design of Tuned Turbo Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Christian Koller, Daniel J. Costello Jr, Francesca Vatta, Joerg Kliewer, Kamil S. Zigangirov","submitted_at":"2010-10-25T22:39:09Z","abstract_excerpt":"It has been widely observed that there exists a fundamental trade-off between the minimum (Hamming) distance properties and the iterative decoding convergence behavior of turbo-like codes. While capacity achieving code ensembles typically are asymptotically bad in the sense that their minimum distance does not grow linearly with block length, and they therefore exhibit an error floor at moderate-to-high signal to noise ratios, asymptotically good codes usually converge further away from channel capacity. In this paper, we introduce the concept of tuned turbo codes, a family of asymptotically g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5278","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":"1010.5278","created_at":"2026-05-18T03:56:08.697834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5278v2","created_at":"2026-05-18T03:56:08.697834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5278","created_at":"2026-05-18T03:56:08.697834+00:00"},{"alias_kind":"pith_short_12","alias_value":"QD3OL5CHVLBF","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QD3OL5CHVLBFQL3R","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QD3OL5CH","created_at":"2026-05-18T12:26:12.377268+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/QD3OL5CHVLBFQL3RWN2JXAST6H","json":"https://pith.science/pith/QD3OL5CHVLBFQL3RWN2JXAST6H.json","graph_json":"https://pith.science/api/pith-number/QD3OL5CHVLBFQL3RWN2JXAST6H/graph.json","events_json":"https://pith.science/api/pith-number/QD3OL5CHVLBFQL3RWN2JXAST6H/events.json","paper":"https://pith.science/paper/QD3OL5CH"},"agent_actions":{"view_html":"https://pith.science/pith/QD3OL5CHVLBFQL3RWN2JXAST6H","download_json":"https://pith.science/pith/QD3OL5CHVLBFQL3RWN2JXAST6H.json","view_paper":"https://pith.science/paper/QD3OL5CH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5278&json=true","fetch_graph":"https://pith.science/api/pith-number/QD3OL5CHVLBFQL3RWN2JXAST6H/graph.json","fetch_events":"https://pith.science/api/pith-number/QD3OL5CHVLBFQL3RWN2JXAST6H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QD3OL5CHVLBFQL3RWN2JXAST6H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QD3OL5CHVLBFQL3RWN2JXAST6H/action/storage_attestation","attest_author":"https://pith.science/pith/QD3OL5CHVLBFQL3RWN2JXAST6H/action/author_attestation","sign_citation":"https://pith.science/pith/QD3OL5CHVLBFQL3RWN2JXAST6H/action/citation_signature","submit_replication":"https://pith.science/pith/QD3OL5CHVLBFQL3RWN2JXAST6H/action/replication_record"}},"created_at":"2026-05-18T03:56:08.697834+00:00","updated_at":"2026-05-18T03:56:08.697834+00:00"}