{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IQALMRN2KGOZJEGPQYOXVOJRTJ","short_pith_number":"pith:IQALMRN2","schema_version":"1.0","canonical_sha256":"4400b645ba519d9490cf861d7ab9319a5b8ddb271c6877bd64ce2e8b2b133886","source":{"kind":"arxiv","id":"1901.02914","version":2},"attestation_state":"computed","paper":{"title":"Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Alireza Sheikh, Gianluigi Liva","submitted_at":"2019-01-09T19:46:19Z","abstract_excerpt":"We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric. The proposed algorithm closes half of the gap between conventional iterative bounded distance decoding (iBDD) and turbo product decoding based on the Chase--Pyndiah algorithm, at the expense of some increase in complexity. Furthermore, the proposed algorithm entails only a limited increase in data flow compared to iBDD."},"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":"1901.02914","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T19:46:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aac8e2b905fdcaa09bf40d974257fccb501982edfff5ba857ce5a0538c3f7520","abstract_canon_sha256":"7cd0a43658870cc3fb5a6d10d9b373927bd3990372dcb4005ff8a9c9887f2d43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:38.130995Z","signature_b64":"hnibfalwn1VJKbour3FQ3zkqrVQ+XatTDAmecfby/60g4R9sjXsxu12pnosJhRFjTNxLQ0ZZ0oGoVmTN4k3ZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4400b645ba519d9490cf861d7ab9319a5b8ddb271c6877bd64ce2e8b2b133886","last_reissued_at":"2026-05-17T23:55:38.130484Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:38.130484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Alireza Sheikh, Gianluigi Liva","submitted_at":"2019-01-09T19:46:19Z","abstract_excerpt":"We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric. The proposed algorithm closes half of the gap between conventional iterative bounded distance decoding (iBDD) and turbo product decoding based on the Chase--Pyndiah algorithm, at the expense of some increase in complexity. Furthermore, the proposed algorithm entails only a limited increase in data flow compared to iBDD."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02914","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":"1901.02914","created_at":"2026-05-17T23:55:38.130551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02914v2","created_at":"2026-05-17T23:55:38.130551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02914","created_at":"2026-05-17T23:55:38.130551+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQALMRN2KGOZ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQALMRN2KGOZJEGP","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQALMRN2","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09792","citing_title":"A novel soft-aided bit-marking decoder for product codes","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IQALMRN2KGOZJEGPQYOXVOJRTJ","json":"https://pith.science/pith/IQALMRN2KGOZJEGPQYOXVOJRTJ.json","graph_json":"https://pith.science/api/pith-number/IQALMRN2KGOZJEGPQYOXVOJRTJ/graph.json","events_json":"https://pith.science/api/pith-number/IQALMRN2KGOZJEGPQYOXVOJRTJ/events.json","paper":"https://pith.science/paper/IQALMRN2"},"agent_actions":{"view_html":"https://pith.science/pith/IQALMRN2KGOZJEGPQYOXVOJRTJ","download_json":"https://pith.science/pith/IQALMRN2KGOZJEGPQYOXVOJRTJ.json","view_paper":"https://pith.science/paper/IQALMRN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02914&json=true","fetch_graph":"https://pith.science/api/pith-number/IQALMRN2KGOZJEGPQYOXVOJRTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/IQALMRN2KGOZJEGPQYOXVOJRTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQALMRN2KGOZJEGPQYOXVOJRTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQALMRN2KGOZJEGPQYOXVOJRTJ/action/storage_attestation","attest_author":"https://pith.science/pith/IQALMRN2KGOZJEGPQYOXVOJRTJ/action/author_attestation","sign_citation":"https://pith.science/pith/IQALMRN2KGOZJEGPQYOXVOJRTJ/action/citation_signature","submit_replication":"https://pith.science/pith/IQALMRN2KGOZJEGPQYOXVOJRTJ/action/replication_record"}},"created_at":"2026-05-17T23:55:38.130551+00:00","updated_at":"2026-05-17T23:55:38.130551+00:00"}