{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3TD3RMTSJVK4GKZ2V337ZNWOZE","short_pith_number":"pith:3TD3RMTS","schema_version":"1.0","canonical_sha256":"dcc7b8b2724d55c32b3aaef7fcb6cec92bb5d125ac945bd7171b2b0ffd78f51a","source":{"kind":"arxiv","id":"1203.6566","version":2},"attestation_state":"computed","paper":{"title":"New Combinatorial Construction Techniques for Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Gruner, Michael Huber","submitted_at":"2012-03-29T15:56:15Z","abstract_excerpt":"This paper presents several new construction techniques for low-density parity-check (LDPC) and systematic repeat-accumulate (RA) codes. Based on specific classes of combinatorial designs, the improved code design focuses on high-rate structured codes with constant column weights 3 and higher. The proposed codes are efficiently encodable and exhibit good structural properties. Experimental results on decoding performance with the sum-product algorithm show that the novel codes offer substantial practical application potential, for instance, in high-speed applications in magnetic recording and "},"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":"1203.6566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-29T15:56:15Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"380c6300d0fde7ce8c0cc45cc4333ab76510f29ec6256e1f34241e84145d1b38","abstract_canon_sha256":"1b318343558ad61d711d71ffdb09ca0c869e7dacd059ee077d1006c39af1f971"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:01.399504Z","signature_b64":"2KkNkrYL5lLEONewQffOJaircsfeduimz1h/c5Evmidpa59cAwTwXeLjxtZfu/6T0ipDN/l0gNu6G7kHYA78AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcc7b8b2724d55c32b3aaef7fcb6cec92bb5d125ac945bd7171b2b0ffd78f51a","last_reissued_at":"2026-05-18T00:12:01.399040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:01.399040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Combinatorial Construction Techniques for Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Gruner, Michael Huber","submitted_at":"2012-03-29T15:56:15Z","abstract_excerpt":"This paper presents several new construction techniques for low-density parity-check (LDPC) and systematic repeat-accumulate (RA) codes. Based on specific classes of combinatorial designs, the improved code design focuses on high-rate structured codes with constant column weights 3 and higher. The proposed codes are efficiently encodable and exhibit good structural properties. Experimental results on decoding performance with the sum-product algorithm show that the novel codes offer substantial practical application potential, for instance, in high-speed applications in magnetic recording and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6566","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":"1203.6566","created_at":"2026-05-18T00:12:01.399109+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.6566v2","created_at":"2026-05-18T00:12:01.399109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6566","created_at":"2026-05-18T00:12:01.399109+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TD3RMTSJVK4","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TD3RMTSJVK4GKZ2","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TD3RMTS","created_at":"2026-05-18T12:26:53.410803+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/3TD3RMTSJVK4GKZ2V337ZNWOZE","json":"https://pith.science/pith/3TD3RMTSJVK4GKZ2V337ZNWOZE.json","graph_json":"https://pith.science/api/pith-number/3TD3RMTSJVK4GKZ2V337ZNWOZE/graph.json","events_json":"https://pith.science/api/pith-number/3TD3RMTSJVK4GKZ2V337ZNWOZE/events.json","paper":"https://pith.science/paper/3TD3RMTS"},"agent_actions":{"view_html":"https://pith.science/pith/3TD3RMTSJVK4GKZ2V337ZNWOZE","download_json":"https://pith.science/pith/3TD3RMTSJVK4GKZ2V337ZNWOZE.json","view_paper":"https://pith.science/paper/3TD3RMTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.6566&json=true","fetch_graph":"https://pith.science/api/pith-number/3TD3RMTSJVK4GKZ2V337ZNWOZE/graph.json","fetch_events":"https://pith.science/api/pith-number/3TD3RMTSJVK4GKZ2V337ZNWOZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TD3RMTSJVK4GKZ2V337ZNWOZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TD3RMTSJVK4GKZ2V337ZNWOZE/action/storage_attestation","attest_author":"https://pith.science/pith/3TD3RMTSJVK4GKZ2V337ZNWOZE/action/author_attestation","sign_citation":"https://pith.science/pith/3TD3RMTSJVK4GKZ2V337ZNWOZE/action/citation_signature","submit_replication":"https://pith.science/pith/3TD3RMTSJVK4GKZ2V337ZNWOZE/action/replication_record"}},"created_at":"2026-05-18T00:12:01.399109+00:00","updated_at":"2026-05-18T00:12:01.399109+00:00"}