{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JVTCXA3UCN52MALXRWOZSPQSHU","short_pith_number":"pith:JVTCXA3U","schema_version":"1.0","canonical_sha256":"4d662b8374137ba601778d9d993e123d09d6e71227d1173dd1cc295e3c4adf17","source":{"kind":"arxiv","id":"1202.6095","version":4},"attestation_state":"computed","paper":{"title":"Approaching Capacity at High-Rates with Iterative Hard-Decision Decoding","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, Yung-Yih Jian","submitted_at":"2012-02-28T00:10:52Z","abstract_excerpt":"A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) messages and a posteriori probability (APP) decoding of their component codes. In this paper, we show that one can approach capacity at high rates using iterative hard-decision decoding (HDD) of generalized product codes. Specifically, a class of spatially-coupled GLDPC codes with BCH component codes is considered, and it is observed that, in the high-rate regime, they can approach capacity under the proposed iterativ"},"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":"1202.6095","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-28T00:10:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3ff0e9026d78d381ef16f9acd93581aa62a6a8a06dc5e18c282c9312cd667201","abstract_canon_sha256":"92bb6188625fc540bc46bda6eff4a2425c96fe282bbb17c63b782b7124604836"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:18.902149Z","signature_b64":"nhx9gjhfNKjaxdCuZN1bPrHKsBm8gX3jutf//OJ8FL5Zi+4OXrhOKjKJlINWeyEZzo4U1ZN7jdVW0J9Vcu8kAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d662b8374137ba601778d9d993e123d09d6e71227d1173dd1cc295e3c4adf17","last_reissued_at":"2026-05-18T00:44:18.901739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:18.901739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approaching Capacity at High-Rates with Iterative Hard-Decision Decoding","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, Yung-Yih Jian","submitted_at":"2012-02-28T00:10:52Z","abstract_excerpt":"A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) messages and a posteriori probability (APP) decoding of their component codes. In this paper, we show that one can approach capacity at high rates using iterative hard-decision decoding (HDD) of generalized product codes. Specifically, a class of spatially-coupled GLDPC codes with BCH component codes is considered, and it is observed that, in the high-rate regime, they can approach capacity under the proposed iterativ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6095","kind":"arxiv","version":4},"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":"1202.6095","created_at":"2026-05-18T00:44:18.901818+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.6095v4","created_at":"2026-05-18T00:44:18.901818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6095","created_at":"2026-05-18T00:44:18.901818+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVTCXA3UCN52","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVTCXA3UCN52MALX","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVTCXA3U","created_at":"2026-05-18T12:27:11.947152+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/JVTCXA3UCN52MALXRWOZSPQSHU","json":"https://pith.science/pith/JVTCXA3UCN52MALXRWOZSPQSHU.json","graph_json":"https://pith.science/api/pith-number/JVTCXA3UCN52MALXRWOZSPQSHU/graph.json","events_json":"https://pith.science/api/pith-number/JVTCXA3UCN52MALXRWOZSPQSHU/events.json","paper":"https://pith.science/paper/JVTCXA3U"},"agent_actions":{"view_html":"https://pith.science/pith/JVTCXA3UCN52MALXRWOZSPQSHU","download_json":"https://pith.science/pith/JVTCXA3UCN52MALXRWOZSPQSHU.json","view_paper":"https://pith.science/paper/JVTCXA3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.6095&json=true","fetch_graph":"https://pith.science/api/pith-number/JVTCXA3UCN52MALXRWOZSPQSHU/graph.json","fetch_events":"https://pith.science/api/pith-number/JVTCXA3UCN52MALXRWOZSPQSHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVTCXA3UCN52MALXRWOZSPQSHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVTCXA3UCN52MALXRWOZSPQSHU/action/storage_attestation","attest_author":"https://pith.science/pith/JVTCXA3UCN52MALXRWOZSPQSHU/action/author_attestation","sign_citation":"https://pith.science/pith/JVTCXA3UCN52MALXRWOZSPQSHU/action/citation_signature","submit_replication":"https://pith.science/pith/JVTCXA3UCN52MALXRWOZSPQSHU/action/replication_record"}},"created_at":"2026-05-18T00:44:18.901818+00:00","updated_at":"2026-05-18T00:44:18.901818+00:00"}