{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:X47ZPUG63RTO4MECM4CTIWCOJI","short_pith_number":"pith:X47ZPUG6","schema_version":"1.0","canonical_sha256":"bf3f97d0dedc66ee3082670534584e4a387f10410d288b447346a40f070b3770","source":{"kind":"arxiv","id":"1806.03110","version":2},"attestation_state":"computed","paper":{"title":"Multi-Code-Rate Correction Technique with IR-QC-LDPC: An application to QKD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","physics.app-ph"],"primary_cat":"cs.IT","authors_text":"Chengzhi Peng, Hongbo Xie, Kun Cheng, Qiming Lu, Qi Shen, Shengkai Liao","submitted_at":"2018-06-08T12:16:28Z","abstract_excerpt":"In this paper, we report an encoding and decoding method for irregular-quasic-cyclic low-density parity-check (IR-QC-LDPC) codes with multi rates. The algorithm is applicable to parity-check matrices which have dual-diagonal parity structure. The decoding adopts normalized min-sum algorithm(NMSA). The whole verification of encoding and decoding algorithm are simulated with MATLAB, if initial bit error ratio is 6% , the code rate of 2/3 is selected, and if the initial bit error ratio is 1.04%, the code rate of 5/6 is selected. We migrate the algorithm from MATLAB to Field Program Gate Array(FPG"},"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":"1806.03110","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-08T12:16:28Z","cross_cats_sorted":["math.IT","physics.app-ph"],"title_canon_sha256":"68131a24bbbd8a4619cb7a8b1bba673b0c496fd261ee39fbc0e0eb5c2aab3686","abstract_canon_sha256":"f35b5bdeb52ff3b8815be37931e0566a8aa160fb0c0a9d16ddf990377c5a71c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:45.750430Z","signature_b64":"Fc/X8og7U9Leh/JcqJGNMz1bO9qvh8G/8dNeS/PHw3AcWMAQ5OFvcNg9i4w0o78OHuUPgkbC4gZVz9vPnyskCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf3f97d0dedc66ee3082670534584e4a387f10410d288b447346a40f070b3770","last_reissued_at":"2026-07-05T00:15:45.750075Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:45.750075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Code-Rate Correction Technique with IR-QC-LDPC: An application to QKD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","physics.app-ph"],"primary_cat":"cs.IT","authors_text":"Chengzhi Peng, Hongbo Xie, Kun Cheng, Qiming Lu, Qi Shen, Shengkai Liao","submitted_at":"2018-06-08T12:16:28Z","abstract_excerpt":"In this paper, we report an encoding and decoding method for irregular-quasic-cyclic low-density parity-check (IR-QC-LDPC) codes with multi rates. The algorithm is applicable to parity-check matrices which have dual-diagonal parity structure. The decoding adopts normalized min-sum algorithm(NMSA). The whole verification of encoding and decoding algorithm are simulated with MATLAB, if initial bit error ratio is 6% , the code rate of 2/3 is selected, and if the initial bit error ratio is 1.04%, the code rate of 5/6 is selected. We migrate the algorithm from MATLAB to Field Program Gate Array(FPG"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03110","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1806.03110/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1806.03110","created_at":"2026-07-05T00:15:45.750128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03110v2","created_at":"2026-07-05T00:15:45.750128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03110","created_at":"2026-07-05T00:15:45.750128+00:00"},{"alias_kind":"pith_short_12","alias_value":"X47ZPUG63RTO","created_at":"2026-07-05T00:15:45.750128+00:00"},{"alias_kind":"pith_short_16","alias_value":"X47ZPUG63RTO4MEC","created_at":"2026-07-05T00:15:45.750128+00:00"},{"alias_kind":"pith_short_8","alias_value":"X47ZPUG6","created_at":"2026-07-05T00:15:45.750128+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/X47ZPUG63RTO4MECM4CTIWCOJI","json":"https://pith.science/pith/X47ZPUG63RTO4MECM4CTIWCOJI.json","graph_json":"https://pith.science/api/pith-number/X47ZPUG63RTO4MECM4CTIWCOJI/graph.json","events_json":"https://pith.science/api/pith-number/X47ZPUG63RTO4MECM4CTIWCOJI/events.json","paper":"https://pith.science/paper/X47ZPUG6"},"agent_actions":{"view_html":"https://pith.science/pith/X47ZPUG63RTO4MECM4CTIWCOJI","download_json":"https://pith.science/pith/X47ZPUG63RTO4MECM4CTIWCOJI.json","view_paper":"https://pith.science/paper/X47ZPUG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03110&json=true","fetch_graph":"https://pith.science/api/pith-number/X47ZPUG63RTO4MECM4CTIWCOJI/graph.json","fetch_events":"https://pith.science/api/pith-number/X47ZPUG63RTO4MECM4CTIWCOJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X47ZPUG63RTO4MECM4CTIWCOJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X47ZPUG63RTO4MECM4CTIWCOJI/action/storage_attestation","attest_author":"https://pith.science/pith/X47ZPUG63RTO4MECM4CTIWCOJI/action/author_attestation","sign_citation":"https://pith.science/pith/X47ZPUG63RTO4MECM4CTIWCOJI/action/citation_signature","submit_replication":"https://pith.science/pith/X47ZPUG63RTO4MECM4CTIWCOJI/action/replication_record"}},"created_at":"2026-07-05T00:15:45.750128+00:00","updated_at":"2026-07-05T00:15:45.750128+00:00"}