{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QFCNTU6QKVVAT4BCS2474I2MOY","short_pith_number":"pith:QFCNTU6Q","schema_version":"1.0","canonical_sha256":"8144d9d3d0556a09f02296b9fe234c76213860abf7da4e90920b0ec4c86b0c55","source":{"kind":"arxiv","id":"1810.13111","version":2},"attestation_state":"computed","paper":{"title":"Enhanced Quasi-Maximum Likelihood Decoding of Short LDPC Codes based on Saturation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chen Zheng, Jinhong Yuan, Lei Yang, Peng Kang, Yixuan Xie, Yuejun Wei","submitted_at":"2018-10-31T05:17:51Z","abstract_excerpt":"In this paper, we propose an enhanced quasi-maximum likelihood (EQML) decoder for LDPC codes with short block lengths. After the failure of the conventional belief propagation (BP) decoding, the proposed EQML decoder selects unreliable variable nodes (VNs) and saturates their associated channel output values to generate a list of decoder input sequences. Each decoder input sequence in the list is then decoded by the conventional BP decoder to obtain the most likely codeword. To improve the accuracy of selecting unreliable VNs, we propose an edge-wise selection method based on the sign fluctuat"},"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":"1810.13111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-31T05:17:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0818588a2c7ae5622d4ecd90ec4027695f0c71dee18421e698069bbef45e8c00","abstract_canon_sha256":"fbc8edc9b622559c2d79fee51f1bcec187bc146ed04ae4ab31df7794299271e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:07.245915Z","signature_b64":"pWz5/nyozJEQAniJzCmKKg6ONY4vK13SUdGRzc9lYF40eS1+pEcXtrH60Dp77KCPfKhwuUD+BiScTfaE8TN5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8144d9d3d0556a09f02296b9fe234c76213860abf7da4e90920b0ec4c86b0c55","last_reissued_at":"2026-05-17T23:55:07.245349Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:07.245349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhanced Quasi-Maximum Likelihood Decoding of Short LDPC Codes based on Saturation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chen Zheng, Jinhong Yuan, Lei Yang, Peng Kang, Yixuan Xie, Yuejun Wei","submitted_at":"2018-10-31T05:17:51Z","abstract_excerpt":"In this paper, we propose an enhanced quasi-maximum likelihood (EQML) decoder for LDPC codes with short block lengths. After the failure of the conventional belief propagation (BP) decoding, the proposed EQML decoder selects unreliable variable nodes (VNs) and saturates their associated channel output values to generate a list of decoder input sequences. Each decoder input sequence in the list is then decoded by the conventional BP decoder to obtain the most likely codeword. To improve the accuracy of selecting unreliable VNs, we propose an edge-wise selection method based on the sign fluctuat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13111","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":"1810.13111","created_at":"2026-05-17T23:55:07.245439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.13111v2","created_at":"2026-05-17T23:55:07.245439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13111","created_at":"2026-05-17T23:55:07.245439+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFCNTU6QKVVA","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFCNTU6QKVVAT4BC","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFCNTU6Q","created_at":"2026-05-18T12:32:46.962924+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/QFCNTU6QKVVAT4BCS2474I2MOY","json":"https://pith.science/pith/QFCNTU6QKVVAT4BCS2474I2MOY.json","graph_json":"https://pith.science/api/pith-number/QFCNTU6QKVVAT4BCS2474I2MOY/graph.json","events_json":"https://pith.science/api/pith-number/QFCNTU6QKVVAT4BCS2474I2MOY/events.json","paper":"https://pith.science/paper/QFCNTU6Q"},"agent_actions":{"view_html":"https://pith.science/pith/QFCNTU6QKVVAT4BCS2474I2MOY","download_json":"https://pith.science/pith/QFCNTU6QKVVAT4BCS2474I2MOY.json","view_paper":"https://pith.science/paper/QFCNTU6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.13111&json=true","fetch_graph":"https://pith.science/api/pith-number/QFCNTU6QKVVAT4BCS2474I2MOY/graph.json","fetch_events":"https://pith.science/api/pith-number/QFCNTU6QKVVAT4BCS2474I2MOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFCNTU6QKVVAT4BCS2474I2MOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFCNTU6QKVVAT4BCS2474I2MOY/action/storage_attestation","attest_author":"https://pith.science/pith/QFCNTU6QKVVAT4BCS2474I2MOY/action/author_attestation","sign_citation":"https://pith.science/pith/QFCNTU6QKVVAT4BCS2474I2MOY/action/citation_signature","submit_replication":"https://pith.science/pith/QFCNTU6QKVVAT4BCS2474I2MOY/action/replication_record"}},"created_at":"2026-05-17T23:55:07.245439+00:00","updated_at":"2026-05-17T23:55:07.245439+00:00"}