{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:26VQBKBU6LI2P42DM7DKFDHN5N","short_pith_number":"pith:26VQBKBU","schema_version":"1.0","canonical_sha256":"d7ab00a834f2d1a7f34367c6a28cedeb4733616497a3359249ee059f203bc6af","source":{"kind":"arxiv","id":"1408.3357","version":1},"attestation_state":"computed","paper":{"title":"Improved Iterative Hard- and Soft-Reliability Based Majority-Logic Decoding Algorithms for Non-Binary Low-Density Parity-Check Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chenrong Xiong, Zhiyuan Yan","submitted_at":"2014-08-14T17:35:53Z","abstract_excerpt":"Non-binary low-density parity-check (LDPC) codes have some advantages over their binary counterparts, but unfortunately their decoding complexity is a significant challenge. The iterative hard- and soft-reliability based majority-logic decoding algorithms are attractive for non-binary LDPC codes, since they involve only finite field additions and multiplications as well as integer operations and hence have significantly lower complexity than other algorithms. In this paper, we propose two improvements to the majority-logic decoding algorithms. Instead of the accumulation of reliability informa"},"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":"1408.3357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-14T17:35:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ae5abc3e21fade9a004a5ee60c21324b89881b2a91a56ff96aa4439ca80d3e98","abstract_canon_sha256":"dfb1ef829d98023f52a838566eb97855a51d9f2371da6f1c7c40dab9c1d30a0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:18.960577Z","signature_b64":"679+BJer/08xLU8Tvp1fk9lVrJiIaXHLlidDIemY/V5YcUffP1XgbrFvlb7Nzj2/GfgHEybo2AWB+BJw0NWrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7ab00a834f2d1a7f34367c6a28cedeb4733616497a3359249ee059f203bc6af","last_reissued_at":"2026-05-18T01:42:18.959156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:18.959156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Iterative Hard- and Soft-Reliability Based Majority-Logic Decoding Algorithms for Non-Binary Low-Density Parity-Check Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chenrong Xiong, Zhiyuan Yan","submitted_at":"2014-08-14T17:35:53Z","abstract_excerpt":"Non-binary low-density parity-check (LDPC) codes have some advantages over their binary counterparts, but unfortunately their decoding complexity is a significant challenge. The iterative hard- and soft-reliability based majority-logic decoding algorithms are attractive for non-binary LDPC codes, since they involve only finite field additions and multiplications as well as integer operations and hence have significantly lower complexity than other algorithms. In this paper, we propose two improvements to the majority-logic decoding algorithms. Instead of the accumulation of reliability informa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3357","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":"1408.3357","created_at":"2026-05-18T01:42:18.959818+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.3357v1","created_at":"2026-05-18T01:42:18.959818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3357","created_at":"2026-05-18T01:42:18.959818+00:00"},{"alias_kind":"pith_short_12","alias_value":"26VQBKBU6LI2","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"26VQBKBU6LI2P42D","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"26VQBKBU","created_at":"2026-05-18T12:28:09.283467+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/26VQBKBU6LI2P42DM7DKFDHN5N","json":"https://pith.science/pith/26VQBKBU6LI2P42DM7DKFDHN5N.json","graph_json":"https://pith.science/api/pith-number/26VQBKBU6LI2P42DM7DKFDHN5N/graph.json","events_json":"https://pith.science/api/pith-number/26VQBKBU6LI2P42DM7DKFDHN5N/events.json","paper":"https://pith.science/paper/26VQBKBU"},"agent_actions":{"view_html":"https://pith.science/pith/26VQBKBU6LI2P42DM7DKFDHN5N","download_json":"https://pith.science/pith/26VQBKBU6LI2P42DM7DKFDHN5N.json","view_paper":"https://pith.science/paper/26VQBKBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.3357&json=true","fetch_graph":"https://pith.science/api/pith-number/26VQBKBU6LI2P42DM7DKFDHN5N/graph.json","fetch_events":"https://pith.science/api/pith-number/26VQBKBU6LI2P42DM7DKFDHN5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26VQBKBU6LI2P42DM7DKFDHN5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26VQBKBU6LI2P42DM7DKFDHN5N/action/storage_attestation","attest_author":"https://pith.science/pith/26VQBKBU6LI2P42DM7DKFDHN5N/action/author_attestation","sign_citation":"https://pith.science/pith/26VQBKBU6LI2P42DM7DKFDHN5N/action/citation_signature","submit_replication":"https://pith.science/pith/26VQBKBU6LI2P42DM7DKFDHN5N/action/replication_record"}},"created_at":"2026-05-18T01:42:18.959818+00:00","updated_at":"2026-05-18T01:42:18.959818+00:00"}