{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XAIXEYQSFEYX5TCPAV2JLLJVCB","short_pith_number":"pith:XAIXEYQS","schema_version":"1.0","canonical_sha256":"b81172621229317ecc4f057495ad35107d2f1d22242eb99d3ac28e67f5b368be","source":{"kind":"arxiv","id":"1701.07531","version":4},"attestation_state":"computed","paper":{"title":"Design of Improved Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes for Short Block-Lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dariush Divsalar, Richard D. Wesel, Sudarsan V. S. Ranganathan","submitted_at":"2017-01-26T00:43:15Z","abstract_excerpt":"Protograph-based Raptor-like low-density parity-check codes (PBRL codes) are a recently proposed family of easily encodable and decodable rate-compatible LDPC (RC-LDPC) codes. These codes have an excellent iterative decoding threshold and performance across all design rates. PBRL codes designed thus far, for both long and short block-lengths, have been based on optimizing the iterative decoding threshold of the protograph of the RC code family at various design rates.\n  In this work, we propose a design method to obtain better quasi-cyclic (QC) RC-LDPC codes with PBRL structure for short block"},"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":"1701.07531","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-26T00:43:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"12ba72257dabe8168462528b3ecd36fb5db01903cf5755baadae2d92881f6f8c","abstract_canon_sha256":"7270a8adeeafc888236d04c9acfef0dd44a675679cec4e8929d9a5e4e3696162"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:51.342809Z","signature_b64":"/l40YkJ5ETqDeXbqjQsLfmehAaPpxYsl0c4Iie+ZbAv6n+HDSk0hKKZ/kN47JoBb2jtLAQ86O98mWN8ged7MAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b81172621229317ecc4f057495ad35107d2f1d22242eb99d3ac28e67f5b368be","last_reissued_at":"2026-05-18T00:42:51.341960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:51.341960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Design of Improved Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes for Short Block-Lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dariush Divsalar, Richard D. Wesel, Sudarsan V. S. Ranganathan","submitted_at":"2017-01-26T00:43:15Z","abstract_excerpt":"Protograph-based Raptor-like low-density parity-check codes (PBRL codes) are a recently proposed family of easily encodable and decodable rate-compatible LDPC (RC-LDPC) codes. These codes have an excellent iterative decoding threshold and performance across all design rates. PBRL codes designed thus far, for both long and short block-lengths, have been based on optimizing the iterative decoding threshold of the protograph of the RC code family at various design rates.\n  In this work, we propose a design method to obtain better quasi-cyclic (QC) RC-LDPC codes with PBRL structure for short block"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07531","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":"1701.07531","created_at":"2026-05-18T00:42:51.342106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07531v4","created_at":"2026-05-18T00:42:51.342106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07531","created_at":"2026-05-18T00:42:51.342106+00:00"},{"alias_kind":"pith_short_12","alias_value":"XAIXEYQSFEYX","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XAIXEYQSFEYX5TCP","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XAIXEYQS","created_at":"2026-05-18T12:31:53.515858+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/XAIXEYQSFEYX5TCPAV2JLLJVCB","json":"https://pith.science/pith/XAIXEYQSFEYX5TCPAV2JLLJVCB.json","graph_json":"https://pith.science/api/pith-number/XAIXEYQSFEYX5TCPAV2JLLJVCB/graph.json","events_json":"https://pith.science/api/pith-number/XAIXEYQSFEYX5TCPAV2JLLJVCB/events.json","paper":"https://pith.science/paper/XAIXEYQS"},"agent_actions":{"view_html":"https://pith.science/pith/XAIXEYQSFEYX5TCPAV2JLLJVCB","download_json":"https://pith.science/pith/XAIXEYQSFEYX5TCPAV2JLLJVCB.json","view_paper":"https://pith.science/paper/XAIXEYQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07531&json=true","fetch_graph":"https://pith.science/api/pith-number/XAIXEYQSFEYX5TCPAV2JLLJVCB/graph.json","fetch_events":"https://pith.science/api/pith-number/XAIXEYQSFEYX5TCPAV2JLLJVCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XAIXEYQSFEYX5TCPAV2JLLJVCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XAIXEYQSFEYX5TCPAV2JLLJVCB/action/storage_attestation","attest_author":"https://pith.science/pith/XAIXEYQSFEYX5TCPAV2JLLJVCB/action/author_attestation","sign_citation":"https://pith.science/pith/XAIXEYQSFEYX5TCPAV2JLLJVCB/action/citation_signature","submit_replication":"https://pith.science/pith/XAIXEYQSFEYX5TCPAV2JLLJVCB/action/replication_record"}},"created_at":"2026-05-18T00:42:51.342106+00:00","updated_at":"2026-05-18T00:42:51.342106+00:00"}