{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:O527SMZR5JMGVDL5Q4RXTKASCD","short_pith_number":"pith:O527SMZR","schema_version":"1.0","canonical_sha256":"7775f93331ea586a8d7d872379a81210f5d8f8964bab464dc3204b47491ef2a2","source":{"kind":"arxiv","id":"1205.4070","version":1},"attestation_state":"computed","paper":{"title":"A New Ensemble of Rate-Compatible LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baoming Bai, Kai Zhang, Shancheng Zhao, Xiao Ma, Xiaoyi Zhang","submitted_at":"2012-05-18T02:32:03Z","abstract_excerpt":"In this paper, we presented three approaches to improve the design of Kite codes (newly proposed rateless codes), resulting in an ensemble of rate-compatible\n  LDPC codes with code rates varying \"continuously\" from 0.1 to 0.9 for additive white Gaussian noise (AWGN) channels. The new ensemble rate-compatible LDPC codes can be constructed conveniently with an empirical formula. Simulation results show that, when applied to incremental redundancy hybrid automatic repeat request (IR-HARQ) system, the constructed codes (with higher order modulation) perform well in a wide range of signal-to-noise-"},"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":"1205.4070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-18T02:32:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"285a178a66687242a9a7996b7861c1667ff56988ee93424e4ce12e196655a51a","abstract_canon_sha256":"828d0259d6edbb408517b259dd9eea7c3fe9fd886da8b96051ce81b299e3ead0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:22.794526Z","signature_b64":"1tZekB8NQ/av+58JcMRhlpbPRYUGQJ+6Fwo3bcHEFH8nt9TfhwIttTUh5bWWPwueJVPgwxbdWELLmRVKrWkRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7775f93331ea586a8d7d872379a81210f5d8f8964bab464dc3204b47491ef2a2","last_reissued_at":"2026-05-18T03:55:22.793664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:22.793664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Ensemble of Rate-Compatible LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baoming Bai, Kai Zhang, Shancheng Zhao, Xiao Ma, Xiaoyi Zhang","submitted_at":"2012-05-18T02:32:03Z","abstract_excerpt":"In this paper, we presented three approaches to improve the design of Kite codes (newly proposed rateless codes), resulting in an ensemble of rate-compatible\n  LDPC codes with code rates varying \"continuously\" from 0.1 to 0.9 for additive white Gaussian noise (AWGN) channels. The new ensemble rate-compatible LDPC codes can be constructed conveniently with an empirical formula. Simulation results show that, when applied to incremental redundancy hybrid automatic repeat request (IR-HARQ) system, the constructed codes (with higher order modulation) perform well in a wide range of signal-to-noise-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4070","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":"1205.4070","created_at":"2026-05-18T03:55:22.793798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.4070v1","created_at":"2026-05-18T03:55:22.793798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4070","created_at":"2026-05-18T03:55:22.793798+00:00"},{"alias_kind":"pith_short_12","alias_value":"O527SMZR5JMG","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"O527SMZR5JMGVDL5","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"O527SMZR","created_at":"2026-05-18T12:27:16.716162+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/O527SMZR5JMGVDL5Q4RXTKASCD","json":"https://pith.science/pith/O527SMZR5JMGVDL5Q4RXTKASCD.json","graph_json":"https://pith.science/api/pith-number/O527SMZR5JMGVDL5Q4RXTKASCD/graph.json","events_json":"https://pith.science/api/pith-number/O527SMZR5JMGVDL5Q4RXTKASCD/events.json","paper":"https://pith.science/paper/O527SMZR"},"agent_actions":{"view_html":"https://pith.science/pith/O527SMZR5JMGVDL5Q4RXTKASCD","download_json":"https://pith.science/pith/O527SMZR5JMGVDL5Q4RXTKASCD.json","view_paper":"https://pith.science/paper/O527SMZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.4070&json=true","fetch_graph":"https://pith.science/api/pith-number/O527SMZR5JMGVDL5Q4RXTKASCD/graph.json","fetch_events":"https://pith.science/api/pith-number/O527SMZR5JMGVDL5Q4RXTKASCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O527SMZR5JMGVDL5Q4RXTKASCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O527SMZR5JMGVDL5Q4RXTKASCD/action/storage_attestation","attest_author":"https://pith.science/pith/O527SMZR5JMGVDL5Q4RXTKASCD/action/author_attestation","sign_citation":"https://pith.science/pith/O527SMZR5JMGVDL5Q4RXTKASCD/action/citation_signature","submit_replication":"https://pith.science/pith/O527SMZR5JMGVDL5Q4RXTKASCD/action/replication_record"}},"created_at":"2026-05-18T03:55:22.793798+00:00","updated_at":"2026-05-18T03:55:22.793798+00:00"}