{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4OJ67HDZVRG2PU5AV3NYVPVWSO","short_pith_number":"pith:4OJ67HDZ","schema_version":"1.0","canonical_sha256":"e393ef9c79ac4da7d3a0aedb8abeb693ad23f646f5b1d80d0bfe704c6226d2b0","source":{"kind":"arxiv","id":"1409.5141","version":2},"attestation_state":"computed","paper":{"title":"ADMM LP decoding of non-binary LDPC codes in $\\mathbb{F}_{2^m}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Stark C. Draper, Xishuo Liu","submitted_at":"2014-09-17T20:40:47Z","abstract_excerpt":"In this paper, we develop efficient decoders for non-binary low-density parity-check (LDPC) codes using the alternating direction method of multipliers (ADMM). We apply ADMM to two decoding problems. The first problem is linear programming (LP) decoding. In order to develop an efficient algorithm, we focus on non-binary codes in fields of characteristic two. This allows us to transform each constraint in $\\mathbb{F}_{2^m}$ to a set of constraints in $\\mathbb{F}_{2}$ that has a factor graph representation. Applying ADMM to the LP decoding problem results in two types of non-trivial sub-routines"},"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":"1409.5141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-17T20:40:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3690742c66de95be808cfb44c23fbec64c631cece919ad619d25343525cd6e8e","abstract_canon_sha256":"d88c13f932e4306197feab771f3be61f250098fc3ef7ac52a2c1e44bf8c5e0db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:13.959018Z","signature_b64":"9ceRsdvx/E0pJrKj3OLG4MTxl35xalBj/rbEZQAU2s8qZ9Ht9N+6QRlt+9q53Wq98JWQXI9RCI7TDNkDGK/iDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e393ef9c79ac4da7d3a0aedb8abeb693ad23f646f5b1d80d0bfe704c6226d2b0","last_reissued_at":"2026-05-18T01:36:13.958526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:13.958526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ADMM LP decoding of non-binary LDPC codes in $\\mathbb{F}_{2^m}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Stark C. Draper, Xishuo Liu","submitted_at":"2014-09-17T20:40:47Z","abstract_excerpt":"In this paper, we develop efficient decoders for non-binary low-density parity-check (LDPC) codes using the alternating direction method of multipliers (ADMM). We apply ADMM to two decoding problems. The first problem is linear programming (LP) decoding. In order to develop an efficient algorithm, we focus on non-binary codes in fields of characteristic two. This allows us to transform each constraint in $\\mathbb{F}_{2^m}$ to a set of constraints in $\\mathbb{F}_{2}$ that has a factor graph representation. Applying ADMM to the LP decoding problem results in two types of non-trivial sub-routines"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5141","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":"1409.5141","created_at":"2026-05-18T01:36:13.958621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5141v2","created_at":"2026-05-18T01:36:13.958621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5141","created_at":"2026-05-18T01:36:13.958621+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OJ67HDZVRG2","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OJ67HDZVRG2PU5A","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OJ67HDZ","created_at":"2026-05-18T12:28:14.216126+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/4OJ67HDZVRG2PU5AV3NYVPVWSO","json":"https://pith.science/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO.json","graph_json":"https://pith.science/api/pith-number/4OJ67HDZVRG2PU5AV3NYVPVWSO/graph.json","events_json":"https://pith.science/api/pith-number/4OJ67HDZVRG2PU5AV3NYVPVWSO/events.json","paper":"https://pith.science/paper/4OJ67HDZ"},"agent_actions":{"view_html":"https://pith.science/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO","download_json":"https://pith.science/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO.json","view_paper":"https://pith.science/paper/4OJ67HDZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5141&json=true","fetch_graph":"https://pith.science/api/pith-number/4OJ67HDZVRG2PU5AV3NYVPVWSO/graph.json","fetch_events":"https://pith.science/api/pith-number/4OJ67HDZVRG2PU5AV3NYVPVWSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO/action/storage_attestation","attest_author":"https://pith.science/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO/action/author_attestation","sign_citation":"https://pith.science/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO/action/citation_signature","submit_replication":"https://pith.science/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO/action/replication_record"}},"created_at":"2026-05-18T01:36:13.958621+00:00","updated_at":"2026-05-18T01:36:13.958621+00:00"}