{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7S265RQQGX3B5TQTCGAQBXXSSR","short_pith_number":"pith:7S265RQQ","schema_version":"1.0","canonical_sha256":"fcb5eec61035f61ece13118100def2944615f46dc0a2240ee200a9c0e79507b6","source":{"kind":"arxiv","id":"1711.07805","version":1},"attestation_state":"computed","paper":{"title":"Approaching Miscorrection-free Performance of Product and Generalized Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian H\\\"ager, Henry D. Pfister","submitted_at":"2017-11-21T14:31:25Z","abstract_excerpt":"Product codes (PCs) protect a two-dimensional array of bits using short component codes. Assuming transmission over the binary symmetric channel, the decoding is commonly performed by iteratively applying bounded-distance decoding to the component codes. For this coding scheme, undetected errors in the component decoding-also known as miscorrections-significantly degrade the performance. In this paper, we propose a novel iterative decoding algorithm for PCs which can detect and avoid most miscorrections. The algorithm can also be used to decode many recently proposed classes of generalized PCs"},"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":"1711.07805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T14:31:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e10b0669facc383363549833671af0890e676aa5cabf2c5028c7623dda351cc8","abstract_canon_sha256":"41496fbe226616e033f0f6a9f9e8d455fcc6c8714e163936a9b48373854f1d71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:56.473374Z","signature_b64":"EFFThRySUmfFeIsWWGxz1iZVfetKvfMBMI8AlFLq+w23GxbYq25rh+7cSQg1QJVpMpOxGbkagU7TDas7L+91Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcb5eec61035f61ece13118100def2944615f46dc0a2240ee200a9c0e79507b6","last_reissued_at":"2026-05-18T00:29:56.472771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:56.472771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approaching Miscorrection-free Performance of Product and Generalized Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian H\\\"ager, Henry D. Pfister","submitted_at":"2017-11-21T14:31:25Z","abstract_excerpt":"Product codes (PCs) protect a two-dimensional array of bits using short component codes. Assuming transmission over the binary symmetric channel, the decoding is commonly performed by iteratively applying bounded-distance decoding to the component codes. For this coding scheme, undetected errors in the component decoding-also known as miscorrections-significantly degrade the performance. In this paper, we propose a novel iterative decoding algorithm for PCs which can detect and avoid most miscorrections. The algorithm can also be used to decode many recently proposed classes of generalized PCs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07805","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":"1711.07805","created_at":"2026-05-18T00:29:56.472873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07805v1","created_at":"2026-05-18T00:29:56.472873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07805","created_at":"2026-05-18T00:29:56.472873+00:00"},{"alias_kind":"pith_short_12","alias_value":"7S265RQQGX3B","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7S265RQQGX3B5TQT","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7S265RQQ","created_at":"2026-05-18T12:31:05.417338+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/7S265RQQGX3B5TQTCGAQBXXSSR","json":"https://pith.science/pith/7S265RQQGX3B5TQTCGAQBXXSSR.json","graph_json":"https://pith.science/api/pith-number/7S265RQQGX3B5TQTCGAQBXXSSR/graph.json","events_json":"https://pith.science/api/pith-number/7S265RQQGX3B5TQTCGAQBXXSSR/events.json","paper":"https://pith.science/paper/7S265RQQ"},"agent_actions":{"view_html":"https://pith.science/pith/7S265RQQGX3B5TQTCGAQBXXSSR","download_json":"https://pith.science/pith/7S265RQQGX3B5TQTCGAQBXXSSR.json","view_paper":"https://pith.science/paper/7S265RQQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07805&json=true","fetch_graph":"https://pith.science/api/pith-number/7S265RQQGX3B5TQTCGAQBXXSSR/graph.json","fetch_events":"https://pith.science/api/pith-number/7S265RQQGX3B5TQTCGAQBXXSSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7S265RQQGX3B5TQTCGAQBXXSSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7S265RQQGX3B5TQTCGAQBXXSSR/action/storage_attestation","attest_author":"https://pith.science/pith/7S265RQQGX3B5TQTCGAQBXXSSR/action/author_attestation","sign_citation":"https://pith.science/pith/7S265RQQGX3B5TQTCGAQBXXSSR/action/citation_signature","submit_replication":"https://pith.science/pith/7S265RQQGX3B5TQTCGAQBXXSSR/action/replication_record"}},"created_at":"2026-05-18T00:29:56.472873+00:00","updated_at":"2026-05-18T00:29:56.472873+00:00"}