{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:XASGVWCJZL2FU3R44S7X7GYCSD","short_pith_number":"pith:XASGVWCJ","schema_version":"1.0","canonical_sha256":"b8246ad849caf45a6e3ce4bf7f9b0290e965f68b23ccb2bc6cf5a0e55be4ee63","source":{"kind":"arxiv","id":"0901.4129","version":2},"attestation_state":"computed","paper":{"title":"Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Pascal O. Vontobel, Roxana Smarandache","submitted_at":"2009-01-26T22:22:49Z","abstract_excerpt":"Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-graph-based LDPC codes. In this paper we present upper bounds on the minimum Hamming distance of QC LDPC codes and study how these upper bounds depend on graph structure parameters (like variable degrees, check node degrees, girth) of the Tanner graph and of the underlying proto-graph. Moreover, for several classes of proto-graphs we present explicit QC LDPC code constructions that achieve (or come close to) the respective minimum Hamming distance upper bounds. Because of the tight algebraic connection b"},"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":"0901.4129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-26T22:22:49Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"a1bdcbc5d30d72e833ffab329ad7fd94da3287573648a5b6baa303a25b1065f5","abstract_canon_sha256":"7a7aa170c8ac58a71adb9c8d0175b596f53dfd34e35f15544a355e60b3f7a16d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.254748Z","signature_b64":"L2vCbroQAIsdjG4JeFbrqxWUjoKigG83WyVVva5HA5+q74z8BLW9ASuaGVqQp4SLTGL+9ldngG3ykwXozXaNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8246ad849caf45a6e3ce4bf7f9b0290e965f68b23ccb2bc6cf5a0e55be4ee63","last_reissued_at":"2026-05-18T00:58:48.254208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.254208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Pascal O. Vontobel, Roxana Smarandache","submitted_at":"2009-01-26T22:22:49Z","abstract_excerpt":"Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-graph-based LDPC codes. In this paper we present upper bounds on the minimum Hamming distance of QC LDPC codes and study how these upper bounds depend on graph structure parameters (like variable degrees, check node degrees, girth) of the Tanner graph and of the underlying proto-graph. Moreover, for several classes of proto-graphs we present explicit QC LDPC code constructions that achieve (or come close to) the respective minimum Hamming distance upper bounds. Because of the tight algebraic connection b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.4129","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":"0901.4129","created_at":"2026-05-18T00:58:48.254293+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.4129v2","created_at":"2026-05-18T00:58:48.254293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.4129","created_at":"2026-05-18T00:58:48.254293+00:00"},{"alias_kind":"pith_short_12","alias_value":"XASGVWCJZL2F","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"XASGVWCJZL2FU3R4","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"XASGVWCJ","created_at":"2026-05-18T12:26:02.257875+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/XASGVWCJZL2FU3R44S7X7GYCSD","json":"https://pith.science/pith/XASGVWCJZL2FU3R44S7X7GYCSD.json","graph_json":"https://pith.science/api/pith-number/XASGVWCJZL2FU3R44S7X7GYCSD/graph.json","events_json":"https://pith.science/api/pith-number/XASGVWCJZL2FU3R44S7X7GYCSD/events.json","paper":"https://pith.science/paper/XASGVWCJ"},"agent_actions":{"view_html":"https://pith.science/pith/XASGVWCJZL2FU3R44S7X7GYCSD","download_json":"https://pith.science/pith/XASGVWCJZL2FU3R44S7X7GYCSD.json","view_paper":"https://pith.science/paper/XASGVWCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.4129&json=true","fetch_graph":"https://pith.science/api/pith-number/XASGVWCJZL2FU3R44S7X7GYCSD/graph.json","fetch_events":"https://pith.science/api/pith-number/XASGVWCJZL2FU3R44S7X7GYCSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XASGVWCJZL2FU3R44S7X7GYCSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XASGVWCJZL2FU3R44S7X7GYCSD/action/storage_attestation","attest_author":"https://pith.science/pith/XASGVWCJZL2FU3R44S7X7GYCSD/action/author_attestation","sign_citation":"https://pith.science/pith/XASGVWCJZL2FU3R44S7X7GYCSD/action/citation_signature","submit_replication":"https://pith.science/pith/XASGVWCJZL2FU3R44S7X7GYCSD/action/replication_record"}},"created_at":"2026-05-18T00:58:48.254293+00:00","updated_at":"2026-05-18T00:58:48.254293+00:00"}