{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2BVT5FHKC634P6QA6VUYF7VO46","short_pith_number":"pith:2BVT5FHK","schema_version":"1.0","canonical_sha256":"d06b3e94ea17b7c7fa00f56982feaee7a8736d9e106d4ced85a321fe99d17263","source":{"kind":"arxiv","id":"1512.02520","version":1},"attestation_state":"computed","paper":{"title":"Study of Structured Root-LDPC Codes and PEG Techniques for Block-Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. G. D. Uchoa, C. T. Healy, R. C. de Lamare","submitted_at":"2015-12-08T16:14:26Z","abstract_excerpt":"In this work, we propose structured Root-Low-Density Parity-Check (LDPC) codes and design techniques for block-fading channels. In particular, Quasi-Cyclic Root-LDPC codes, Irregular repeat-accumulate Root-LDPC codes and Controlled Doping Root-LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels are proposed. The proposed Root-LDPC codes are both suitable for channels under $F = 2, 3$ and $4$ independent fading per codeword. The performance of the proposed codes is investigated in terms of Frame Error Rate (FER). The proposed Root-LDPC codes are capable of ach"},"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":"1512.02520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-08T16:14:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bc6f81a2173033d5cac2e29a770adf76b2aced3c87ab6ea0b8459e11c5949b7e","abstract_canon_sha256":"587cd2203497c09818614955fec62838c9dcfb9e056ff311d60e7f9c1191dd45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:44.512806Z","signature_b64":"upNMYSs/3Vy3YArSSX/er8Vy8rCqHSMJIY3tf4O0l75S74lQrEAwfClaaCzVlulaExEDrfZUyBoGRpQjOSB6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d06b3e94ea17b7c7fa00f56982feaee7a8736d9e106d4ced85a321fe99d17263","last_reissued_at":"2026-05-18T01:24:44.512280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:44.512280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Study of Structured Root-LDPC Codes and PEG Techniques for Block-Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. G. D. Uchoa, C. T. Healy, R. C. de Lamare","submitted_at":"2015-12-08T16:14:26Z","abstract_excerpt":"In this work, we propose structured Root-Low-Density Parity-Check (LDPC) codes and design techniques for block-fading channels. In particular, Quasi-Cyclic Root-LDPC codes, Irregular repeat-accumulate Root-LDPC codes and Controlled Doping Root-LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels are proposed. The proposed Root-LDPC codes are both suitable for channels under $F = 2, 3$ and $4$ independent fading per codeword. The performance of the proposed codes is investigated in terms of Frame Error Rate (FER). The proposed Root-LDPC codes are capable of ach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02520","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":"1512.02520","created_at":"2026-05-18T01:24:44.512372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02520v1","created_at":"2026-05-18T01:24:44.512372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02520","created_at":"2026-05-18T01:24:44.512372+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BVT5FHKC634","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BVT5FHKC634P6QA","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BVT5FHK","created_at":"2026-05-18T12:28:59.999130+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/2BVT5FHKC634P6QA6VUYF7VO46","json":"https://pith.science/pith/2BVT5FHKC634P6QA6VUYF7VO46.json","graph_json":"https://pith.science/api/pith-number/2BVT5FHKC634P6QA6VUYF7VO46/graph.json","events_json":"https://pith.science/api/pith-number/2BVT5FHKC634P6QA6VUYF7VO46/events.json","paper":"https://pith.science/paper/2BVT5FHK"},"agent_actions":{"view_html":"https://pith.science/pith/2BVT5FHKC634P6QA6VUYF7VO46","download_json":"https://pith.science/pith/2BVT5FHKC634P6QA6VUYF7VO46.json","view_paper":"https://pith.science/paper/2BVT5FHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02520&json=true","fetch_graph":"https://pith.science/api/pith-number/2BVT5FHKC634P6QA6VUYF7VO46/graph.json","fetch_events":"https://pith.science/api/pith-number/2BVT5FHKC634P6QA6VUYF7VO46/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BVT5FHKC634P6QA6VUYF7VO46/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BVT5FHKC634P6QA6VUYF7VO46/action/storage_attestation","attest_author":"https://pith.science/pith/2BVT5FHKC634P6QA6VUYF7VO46/action/author_attestation","sign_citation":"https://pith.science/pith/2BVT5FHKC634P6QA6VUYF7VO46/action/citation_signature","submit_replication":"https://pith.science/pith/2BVT5FHKC634P6QA6VUYF7VO46/action/replication_record"}},"created_at":"2026-05-18T01:24:44.512372+00:00","updated_at":"2026-05-18T01:24:44.512372+00:00"}