{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:7MD227MPOTUS6QK5QZ665QSEDE","short_pith_number":"pith:7MD227MP","schema_version":"1.0","canonical_sha256":"fb07ad7d8f74e92f415d867deec24419230a181f1ab1489dfa3e00a17f2528ac","source":{"kind":"arxiv","id":"0808.3756","version":2},"attestation_state":"computed","paper":{"title":"Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Jie Luo, Zheng Wang","submitted_at":"2008-08-27T19:32:45Z","abstract_excerpt":"Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion to general discrete-time memoryless channels and shows that Forney's and Blokh-Zyablov error exponents can be arbitrarily approached by one-level and multi-level concatenated codes with linear encoding/decoding complexity. The key result is a revision to Forney's general minimum distance decoding algorithm, which enables a low complexity integration of Guruswami-Indyk's outer codes into the concatenated coding schemes."},"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":"0808.3756","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-27T19:32:45Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"88ed62e2eb556c5b1b56886ad3b73c6b2bff1adb870344f78f12b2e849c08c31","abstract_canon_sha256":"513905cc393122873046891da2c0b6683d42f93b6595eebc5b3fcb60a2fefe63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.415627Z","signature_b64":"/afvmEGIo3rHWhiJZ0J7dFZSDsn3dKNj7WofvDQQP0Zt2Iw9M+sO/ZeBKnPii1l1FCSFJF7g7ugSibcWpDg1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb07ad7d8f74e92f415d867deec24419230a181f1ab1489dfa3e00a17f2528ac","last_reissued_at":"2026-05-18T00:58:48.415127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.415127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Jie Luo, Zheng Wang","submitted_at":"2008-08-27T19:32:45Z","abstract_excerpt":"Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion to general discrete-time memoryless channels and shows that Forney's and Blokh-Zyablov error exponents can be arbitrarily approached by one-level and multi-level concatenated codes with linear encoding/decoding complexity. The key result is a revision to Forney's general minimum distance decoding algorithm, which enables a low complexity integration of Guruswami-Indyk's outer codes into the concatenated coding schemes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.3756","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":"0808.3756","created_at":"2026-05-18T00:58:48.415202+00:00"},{"alias_kind":"arxiv_version","alias_value":"0808.3756v2","created_at":"2026-05-18T00:58:48.415202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.3756","created_at":"2026-05-18T00:58:48.415202+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MD227MPOTUS","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MD227MPOTUS6QK5","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MD227MP","created_at":"2026-05-18T12:25:56.245647+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/7MD227MPOTUS6QK5QZ665QSEDE","json":"https://pith.science/pith/7MD227MPOTUS6QK5QZ665QSEDE.json","graph_json":"https://pith.science/api/pith-number/7MD227MPOTUS6QK5QZ665QSEDE/graph.json","events_json":"https://pith.science/api/pith-number/7MD227MPOTUS6QK5QZ665QSEDE/events.json","paper":"https://pith.science/paper/7MD227MP"},"agent_actions":{"view_html":"https://pith.science/pith/7MD227MPOTUS6QK5QZ665QSEDE","download_json":"https://pith.science/pith/7MD227MPOTUS6QK5QZ665QSEDE.json","view_paper":"https://pith.science/paper/7MD227MP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0808.3756&json=true","fetch_graph":"https://pith.science/api/pith-number/7MD227MPOTUS6QK5QZ665QSEDE/graph.json","fetch_events":"https://pith.science/api/pith-number/7MD227MPOTUS6QK5QZ665QSEDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MD227MPOTUS6QK5QZ665QSEDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MD227MPOTUS6QK5QZ665QSEDE/action/storage_attestation","attest_author":"https://pith.science/pith/7MD227MPOTUS6QK5QZ665QSEDE/action/author_attestation","sign_citation":"https://pith.science/pith/7MD227MPOTUS6QK5QZ665QSEDE/action/citation_signature","submit_replication":"https://pith.science/pith/7MD227MPOTUS6QK5QZ665QSEDE/action/replication_record"}},"created_at":"2026-05-18T00:58:48.415202+00:00","updated_at":"2026-05-18T00:58:48.415202+00:00"}