{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3GACHIQ2H75MGAIYTG7OS7GKFY","short_pith_number":"pith:3GACHIQ2","schema_version":"1.0","canonical_sha256":"d98023a21a3ffac3011899bee97cca2e2d1545ae4084795fcb62d19137b565e6","source":{"kind":"arxiv","id":"1202.0702","version":1},"attestation_state":"computed","paper":{"title":"Low-Density Arrays of Circulant Matrices: Rank and Row-Redundancy Analysis, and Quasi-Cyclic LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Keke Liu, Qin Huang, Zulin Wang","submitted_at":"2012-02-03T13:49:35Z","abstract_excerpt":"This paper is concerned with general analysis on the rank and row-redundancy of an array of circulants whose null space defines a QC-LDPC code. Based on the Fourier transform and the properties of conjugacy classes and Hadamard products of matrices, we derive tight upper bounds on rank and row-redundancy for general array of circulants, which make it possible to consider row-redundancy in constructions of QC-LDPC codes to achieve better performance. We further investigate the rank of two types of construction of QC-LDPC codes: constructions based on Vandermonde Matrices and Latin Squares and g"},"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.0702","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T13:49:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9a5b03e342dd5b70db5b5069748ed8a5271664568f377ed20b9721e72ab43efe","abstract_canon_sha256":"73df3eeac4ce7843fbd52906397ad13bb03a58ef167861509284986e73b757bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:08.191857Z","signature_b64":"WHUmhj26IieVMl1A3VkG1Op0+hI8bh1vgAoQ0QS94sqeafwoSB5cgUo21rwGoXXkAW23dPsdnDzXSJFe1+MyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d98023a21a3ffac3011899bee97cca2e2d1545ae4084795fcb62d19137b565e6","last_reissued_at":"2026-05-18T04:03:08.191159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:08.191159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Density Arrays of Circulant Matrices: Rank and Row-Redundancy Analysis, and Quasi-Cyclic LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Keke Liu, Qin Huang, Zulin Wang","submitted_at":"2012-02-03T13:49:35Z","abstract_excerpt":"This paper is concerned with general analysis on the rank and row-redundancy of an array of circulants whose null space defines a QC-LDPC code. Based on the Fourier transform and the properties of conjugacy classes and Hadamard products of matrices, we derive tight upper bounds on rank and row-redundancy for general array of circulants, which make it possible to consider row-redundancy in constructions of QC-LDPC codes to achieve better performance. We further investigate the rank of two types of construction of QC-LDPC codes: constructions based on Vandermonde Matrices and Latin Squares and g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0702","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":"1202.0702","created_at":"2026-05-18T04:03:08.191270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0702v1","created_at":"2026-05-18T04:03:08.191270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0702","created_at":"2026-05-18T04:03:08.191270+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GACHIQ2H75M","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GACHIQ2H75MGAIY","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GACHIQ2","created_at":"2026-05-18T12:26:50.516681+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/3GACHIQ2H75MGAIYTG7OS7GKFY","json":"https://pith.science/pith/3GACHIQ2H75MGAIYTG7OS7GKFY.json","graph_json":"https://pith.science/api/pith-number/3GACHIQ2H75MGAIYTG7OS7GKFY/graph.json","events_json":"https://pith.science/api/pith-number/3GACHIQ2H75MGAIYTG7OS7GKFY/events.json","paper":"https://pith.science/paper/3GACHIQ2"},"agent_actions":{"view_html":"https://pith.science/pith/3GACHIQ2H75MGAIYTG7OS7GKFY","download_json":"https://pith.science/pith/3GACHIQ2H75MGAIYTG7OS7GKFY.json","view_paper":"https://pith.science/paper/3GACHIQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0702&json=true","fetch_graph":"https://pith.science/api/pith-number/3GACHIQ2H75MGAIYTG7OS7GKFY/graph.json","fetch_events":"https://pith.science/api/pith-number/3GACHIQ2H75MGAIYTG7OS7GKFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GACHIQ2H75MGAIYTG7OS7GKFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GACHIQ2H75MGAIYTG7OS7GKFY/action/storage_attestation","attest_author":"https://pith.science/pith/3GACHIQ2H75MGAIYTG7OS7GKFY/action/author_attestation","sign_citation":"https://pith.science/pith/3GACHIQ2H75MGAIYTG7OS7GKFY/action/citation_signature","submit_replication":"https://pith.science/pith/3GACHIQ2H75MGAIYTG7OS7GKFY/action/replication_record"}},"created_at":"2026-05-18T04:03:08.191270+00:00","updated_at":"2026-05-18T04:03:08.191270+00:00"}