{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SHPJ5YMZNDXH7TN7X2PQBUYAMK","short_pith_number":"pith:SHPJ5YMZ","schema_version":"1.0","canonical_sha256":"91de9ee19968ee7fcdbfbe9f00d30062a25719bf9475e96b8429216a4f58dedb","source":{"kind":"arxiv","id":"1207.4807","version":1},"attestation_state":"computed","paper":{"title":"Finite Alphabet Iterative Decoders, Part II: Improved Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bane Vasic, David Declercq, Erbao Li, Shiva Kumar Planjery","submitted_at":"2012-07-19T20:34:30Z","abstract_excerpt":"Recently, we introduced a new class of finite alphabet iterative decoders (FAIDs) for low-density parity-check (LDPC) codes. These decoders are capable of surpassing belief propagation in the error floor region on the Binary Symmetric channel with much lower complexity. In this paper, we introduce a a novel scheme to further increase the guaranteed error correction capability from what is achievable by a FAID on column-weight-three LDPC codes. The proposed scheme uses a plurality of FAIDs which collectively correct more error patterns than a single FAID on a given code. The collection of FAIDs"},"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":"1207.4807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T20:34:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3417c6fa63d75075efbdcd1af6d4bb4f64e863dc3a97ff4240fb7b248c36cbd6","abstract_canon_sha256":"4e144dc8b682e8931b04f33c0a7d26165db1913c0473f6a45c3a6f775cb1972a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.906151Z","signature_b64":"tS1MK9QFjN7dVoO8zsqDIvtGJ+UoN6TghICMdl7OBg6YH3m5WnUxdYsen3lACzHebP9QVoFlaX//yZ7XZrDeDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91de9ee19968ee7fcdbfbe9f00d30062a25719bf9475e96b8429216a4f58dedb","last_reissued_at":"2026-05-18T00:58:42.905683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.905683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite Alphabet Iterative Decoders, Part II: Improved Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bane Vasic, David Declercq, Erbao Li, Shiva Kumar Planjery","submitted_at":"2012-07-19T20:34:30Z","abstract_excerpt":"Recently, we introduced a new class of finite alphabet iterative decoders (FAIDs) for low-density parity-check (LDPC) codes. These decoders are capable of surpassing belief propagation in the error floor region on the Binary Symmetric channel with much lower complexity. In this paper, we introduce a a novel scheme to further increase the guaranteed error correction capability from what is achievable by a FAID on column-weight-three LDPC codes. The proposed scheme uses a plurality of FAIDs which collectively correct more error patterns than a single FAID on a given code. The collection of FAIDs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4807","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":"1207.4807","created_at":"2026-05-18T00:58:42.905748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4807v1","created_at":"2026-05-18T00:58:42.905748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4807","created_at":"2026-05-18T00:58:42.905748+00:00"},{"alias_kind":"pith_short_12","alias_value":"SHPJ5YMZNDXH","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SHPJ5YMZNDXH7TN7","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SHPJ5YMZ","created_at":"2026-05-18T12:27:20.899486+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/SHPJ5YMZNDXH7TN7X2PQBUYAMK","json":"https://pith.science/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK.json","graph_json":"https://pith.science/api/pith-number/SHPJ5YMZNDXH7TN7X2PQBUYAMK/graph.json","events_json":"https://pith.science/api/pith-number/SHPJ5YMZNDXH7TN7X2PQBUYAMK/events.json","paper":"https://pith.science/paper/SHPJ5YMZ"},"agent_actions":{"view_html":"https://pith.science/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK","download_json":"https://pith.science/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK.json","view_paper":"https://pith.science/paper/SHPJ5YMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4807&json=true","fetch_graph":"https://pith.science/api/pith-number/SHPJ5YMZNDXH7TN7X2PQBUYAMK/graph.json","fetch_events":"https://pith.science/api/pith-number/SHPJ5YMZNDXH7TN7X2PQBUYAMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK/action/storage_attestation","attest_author":"https://pith.science/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK/action/author_attestation","sign_citation":"https://pith.science/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK/action/citation_signature","submit_replication":"https://pith.science/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK/action/replication_record"}},"created_at":"2026-05-18T00:58:42.905748+00:00","updated_at":"2026-05-18T00:58:42.905748+00:00"}