{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RIUQYZWZRTA73EKIBO5FERAHH6","short_pith_number":"pith:RIUQYZWZ","schema_version":"1.0","canonical_sha256":"8a290c66d98cc1fd91480bba5244073faad7b1c0cd7c6270bf0e53c37f1ea888","source":{"kind":"arxiv","id":"1708.01761","version":2},"attestation_state":"computed","paper":{"title":"Optimization of Non Binary Parity Check Coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emmanuel Boutillon","submitted_at":"2017-08-05T12:44:26Z","abstract_excerpt":"This paper generalizes the method proposed by Poulliat et al. for the determination of the optimal Galois Field coefficients of a Non-Binary LDPC parity check constraint based on the binary image of the code. Optimal, or almost-optimal, parity check coefficients are given for check degree varying from 4 to 20 and Galois Field varying from GF(64) up to GF(1024). For all given sets of coefficients, no codeword of Hamming weight two exists. A reduced complexity algorithm to compute the binary Hamming weight 3 of a parity check is proposed. When the number of sets of coefficients is too high for a"},"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":"1708.01761","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-05T12:44:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9fe87bc9c6dbbcc99e8acae3efa6f7c42239244efef56ad3c3fea3c173b74e84","abstract_canon_sha256":"1740a0263d333c9be4c9260c029ef3e1812f7ff83bc34effc626d6c10b465fc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:00.964725Z","signature_b64":"Msx/22+YIVLq2X3yt/kATuUCd+BXEZ9YMlWkgkcjzpMxKpz4E81HbBYigUMAQwL7M0TyefARGFLWo2Mf2hKdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a290c66d98cc1fd91480bba5244073faad7b1c0cd7c6270bf0e53c37f1ea888","last_reissued_at":"2026-05-18T00:14:00.964132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:00.964132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization of Non Binary Parity Check Coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emmanuel Boutillon","submitted_at":"2017-08-05T12:44:26Z","abstract_excerpt":"This paper generalizes the method proposed by Poulliat et al. for the determination of the optimal Galois Field coefficients of a Non-Binary LDPC parity check constraint based on the binary image of the code. Optimal, or almost-optimal, parity check coefficients are given for check degree varying from 4 to 20 and Galois Field varying from GF(64) up to GF(1024). For all given sets of coefficients, no codeword of Hamming weight two exists. A reduced complexity algorithm to compute the binary Hamming weight 3 of a parity check is proposed. When the number of sets of coefficients is too high for a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01761","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":"1708.01761","created_at":"2026-05-18T00:14:00.964209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01761v2","created_at":"2026-05-18T00:14:00.964209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01761","created_at":"2026-05-18T00:14:00.964209+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIUQYZWZRTA7","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIUQYZWZRTA73EKI","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIUQYZWZ","created_at":"2026-05-18T12:31:39.905425+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/RIUQYZWZRTA73EKIBO5FERAHH6","json":"https://pith.science/pith/RIUQYZWZRTA73EKIBO5FERAHH6.json","graph_json":"https://pith.science/api/pith-number/RIUQYZWZRTA73EKIBO5FERAHH6/graph.json","events_json":"https://pith.science/api/pith-number/RIUQYZWZRTA73EKIBO5FERAHH6/events.json","paper":"https://pith.science/paper/RIUQYZWZ"},"agent_actions":{"view_html":"https://pith.science/pith/RIUQYZWZRTA73EKIBO5FERAHH6","download_json":"https://pith.science/pith/RIUQYZWZRTA73EKIBO5FERAHH6.json","view_paper":"https://pith.science/paper/RIUQYZWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01761&json=true","fetch_graph":"https://pith.science/api/pith-number/RIUQYZWZRTA73EKIBO5FERAHH6/graph.json","fetch_events":"https://pith.science/api/pith-number/RIUQYZWZRTA73EKIBO5FERAHH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIUQYZWZRTA73EKIBO5FERAHH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIUQYZWZRTA73EKIBO5FERAHH6/action/storage_attestation","attest_author":"https://pith.science/pith/RIUQYZWZRTA73EKIBO5FERAHH6/action/author_attestation","sign_citation":"https://pith.science/pith/RIUQYZWZRTA73EKIBO5FERAHH6/action/citation_signature","submit_replication":"https://pith.science/pith/RIUQYZWZRTA73EKIBO5FERAHH6/action/replication_record"}},"created_at":"2026-05-18T00:14:00.964209+00:00","updated_at":"2026-05-18T00:14:00.964209+00:00"}