{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:7K2PIZDIFDWAIKBCHRIX7ARE7K","short_pith_number":"pith:7K2PIZDI","schema_version":"1.0","canonical_sha256":"fab4f4646828ec0428223c517f8224fa9177e3435a0f84732615b499304ff186","source":{"kind":"arxiv","id":"1005.4461","version":3},"attestation_state":"computed","paper":{"title":"On Multiple Decoding Attempts for Reed-Solomon Codes: A Rate-Distortion Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henry D. Pfister, Krishna R. Narayanan, Phong S. Nguyen","submitted_at":"2010-05-25T00:17:36Z","abstract_excerpt":"One popular approach to soft-decision decoding of Reed-Solomon (RS) codes is based on using multiple trials of a simple RS decoding algorithm in combination with erasing or flipping a set of symbols or bits in each trial. This paper presents a framework based on rate-distortion (RD) theory to analyze these multiple-decoding algorithms. By defining an appropriate distortion measure between an error pattern and an erasure pattern, the successful decoding condition, for a single errors-and-erasures decoding trial, becomes equivalent to distortion being less than a fixed threshold. Finding the bes"},"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":"1005.4461","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-25T00:17:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"44dc3296498a4be806d6758c5f5de5d6b1586969235d6ea803885fa9e2aa36c5","abstract_canon_sha256":"2d820a35a4c27583c2af65252c6cf85875901c304eca0223fe5c5cd2b3a2dd54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:56.147553Z","signature_b64":"VqZv2igpxYolWpCBgQuUdFUfONT+GG02eAQd2sM45UtQAXmrl+wM2+hzJFnRIWhQS5FxKu5Jj4+sHtws4NYRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fab4f4646828ec0428223c517f8224fa9177e3435a0f84732615b499304ff186","last_reissued_at":"2026-05-18T02:23:56.146579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:56.146579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Multiple Decoding Attempts for Reed-Solomon Codes: A Rate-Distortion Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henry D. Pfister, Krishna R. Narayanan, Phong S. Nguyen","submitted_at":"2010-05-25T00:17:36Z","abstract_excerpt":"One popular approach to soft-decision decoding of Reed-Solomon (RS) codes is based on using multiple trials of a simple RS decoding algorithm in combination with erasing or flipping a set of symbols or bits in each trial. This paper presents a framework based on rate-distortion (RD) theory to analyze these multiple-decoding algorithms. By defining an appropriate distortion measure between an error pattern and an erasure pattern, the successful decoding condition, for a single errors-and-erasures decoding trial, becomes equivalent to distortion being less than a fixed threshold. Finding the bes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.4461","kind":"arxiv","version":3},"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":"1005.4461","created_at":"2026-05-18T02:23:56.146673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.4461v3","created_at":"2026-05-18T02:23:56.146673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.4461","created_at":"2026-05-18T02:23:56.146673+00:00"},{"alias_kind":"pith_short_12","alias_value":"7K2PIZDIFDWA","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"7K2PIZDIFDWAIKBC","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"7K2PIZDI","created_at":"2026-05-18T12:26:04.259169+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/7K2PIZDIFDWAIKBCHRIX7ARE7K","json":"https://pith.science/pith/7K2PIZDIFDWAIKBCHRIX7ARE7K.json","graph_json":"https://pith.science/api/pith-number/7K2PIZDIFDWAIKBCHRIX7ARE7K/graph.json","events_json":"https://pith.science/api/pith-number/7K2PIZDIFDWAIKBCHRIX7ARE7K/events.json","paper":"https://pith.science/paper/7K2PIZDI"},"agent_actions":{"view_html":"https://pith.science/pith/7K2PIZDIFDWAIKBCHRIX7ARE7K","download_json":"https://pith.science/pith/7K2PIZDIFDWAIKBCHRIX7ARE7K.json","view_paper":"https://pith.science/paper/7K2PIZDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.4461&json=true","fetch_graph":"https://pith.science/api/pith-number/7K2PIZDIFDWAIKBCHRIX7ARE7K/graph.json","fetch_events":"https://pith.science/api/pith-number/7K2PIZDIFDWAIKBCHRIX7ARE7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7K2PIZDIFDWAIKBCHRIX7ARE7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7K2PIZDIFDWAIKBCHRIX7ARE7K/action/storage_attestation","attest_author":"https://pith.science/pith/7K2PIZDIFDWAIKBCHRIX7ARE7K/action/author_attestation","sign_citation":"https://pith.science/pith/7K2PIZDIFDWAIKBCHRIX7ARE7K/action/citation_signature","submit_replication":"https://pith.science/pith/7K2PIZDIFDWAIKBCHRIX7ARE7K/action/replication_record"}},"created_at":"2026-05-18T02:23:56.146673+00:00","updated_at":"2026-05-18T02:23:56.146673+00:00"}