{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:Z2U2NBJVKTTIXZEDB5KUNVOGRW","short_pith_number":"pith:Z2U2NBJV","schema_version":"1.0","canonical_sha256":"cea9a6853554e68be4830f5546d5c68db3c6b649c4ee5fc2e3c266b09116e6c1","source":{"kind":"arxiv","id":"cs/0509097","version":1},"attestation_state":"computed","paper":{"title":"Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mostafa El-Khamy, Robert J. McEliece","submitted_at":"2005-09-29T07:22:10Z","abstract_excerpt":"In this paper, we present an iterative soft-decision decoding algorithm for Reed-Solomon codes offering both complexity and performance advantages over previously known decoding algorithms. Our algorithm is a list decoding algorithm which combines two powerful soft decision decoding techniques which were previously regarded in the literature as competitive, namely, the Koetter-Vardy algebraic soft-decision decoding algorithm and belief-propagation based on adaptive parity check matrices, recently proposed by Jiang and Narayanan. Building on the Jiang-Narayanan algorithm, we present a belief-pr"},"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":"cs/0509097","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-09-29T07:22:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"83c5fefe199508156996aad2244df2eedc518b91b5a592eedc026f0de5ff2728","abstract_canon_sha256":"d02bdd36922c12a7e6d377b1d8f0c20ed8d86b3f6fb84588af865d8e64ea50ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:36.914246Z","signature_b64":"ky18GbtRG8I9qnQN0dpotSAGspNYR6fIl0xKTB3WFSEp5v91d+kYH1rEe3E7CIBLXvOQEYW0Y3G5TbZlChhYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cea9a6853554e68be4830f5546d5c68db3c6b649c4ee5fc2e3c266b09116e6c1","last_reissued_at":"2026-05-18T02:37:36.913735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:36.913735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mostafa El-Khamy, Robert J. McEliece","submitted_at":"2005-09-29T07:22:10Z","abstract_excerpt":"In this paper, we present an iterative soft-decision decoding algorithm for Reed-Solomon codes offering both complexity and performance advantages over previously known decoding algorithms. Our algorithm is a list decoding algorithm which combines two powerful soft decision decoding techniques which were previously regarded in the literature as competitive, namely, the Koetter-Vardy algebraic soft-decision decoding algorithm and belief-propagation based on adaptive parity check matrices, recently proposed by Jiang and Narayanan. Building on the Jiang-Narayanan algorithm, we present a belief-pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0509097","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":"cs/0509097","created_at":"2026-05-18T02:37:36.913811+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0509097v1","created_at":"2026-05-18T02:37:36.913811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0509097","created_at":"2026-05-18T02:37:36.913811+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2U2NBJVKTTI","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2U2NBJVKTTIXZED","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2U2NBJV","created_at":"2026-05-18T12:25:53.939244+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/Z2U2NBJVKTTIXZEDB5KUNVOGRW","json":"https://pith.science/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW.json","graph_json":"https://pith.science/api/pith-number/Z2U2NBJVKTTIXZEDB5KUNVOGRW/graph.json","events_json":"https://pith.science/api/pith-number/Z2U2NBJVKTTIXZEDB5KUNVOGRW/events.json","paper":"https://pith.science/paper/Z2U2NBJV"},"agent_actions":{"view_html":"https://pith.science/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW","download_json":"https://pith.science/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW.json","view_paper":"https://pith.science/paper/Z2U2NBJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0509097&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2U2NBJVKTTIXZEDB5KUNVOGRW/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2U2NBJVKTTIXZEDB5KUNVOGRW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW/action/storage_attestation","attest_author":"https://pith.science/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW/action/author_attestation","sign_citation":"https://pith.science/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW/action/citation_signature","submit_replication":"https://pith.science/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW/action/replication_record"}},"created_at":"2026-05-18T02:37:36.913811+00:00","updated_at":"2026-05-18T02:37:36.913811+00:00"}