{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OVY32LO6URETPWSXHTCCJQ2VCO","short_pith_number":"pith:OVY32LO6","schema_version":"1.0","canonical_sha256":"7571bd2ddea44937da573cc424c35513b43d6ec63dc717a2f3114796aaa4459d","source":{"kind":"arxiv","id":"1603.07009","version":2},"attestation_state":"computed","paper":{"title":"Narrow-Sense BCH Codes over $\\gf(q)$ with Length $n=\\frac{q^m-1}{q-1}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunsheng Ding, Gennian Ge, Maosheng Xiong, Shuxing Li","submitted_at":"2016-03-22T22:12:37Z","abstract_excerpt":"Cyclic codes over finite fields are widely employed in communication systems, storage devices and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over $\\gf(q)$ with length $n=(q^m-1)/(q-1)$. Little is known about this class of BCH codes when $q>2$. The objective of this paper is to study some of the codes within this class. In particular, the dimension, the minimum distance, and the weight distribution of som"},"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":"1603.07009","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-22T22:12:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1eec86b06df8179a54ada77d0bef776e00f9cc8d375057a29c84a8e65b5c41cf","abstract_canon_sha256":"a223e866066bed1c90e73ee929067f597bc89c1070fe3ee2468b58c2fa4d68ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:45.813564Z","signature_b64":"ETPcKNEkQI/Mg+q51aHr/qzrR+Z48sq+w4X1NoLwQ3N+oHerWwHr2hDGgV7RnE8mHfhXdhl+QSWO6eh2AibEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7571bd2ddea44937da573cc424c35513b43d6ec63dc717a2f3114796aaa4459d","last_reissued_at":"2026-05-18T01:00:45.813150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:45.813150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Narrow-Sense BCH Codes over $\\gf(q)$ with Length $n=\\frac{q^m-1}{q-1}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunsheng Ding, Gennian Ge, Maosheng Xiong, Shuxing Li","submitted_at":"2016-03-22T22:12:37Z","abstract_excerpt":"Cyclic codes over finite fields are widely employed in communication systems, storage devices and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over $\\gf(q)$ with length $n=(q^m-1)/(q-1)$. Little is known about this class of BCH codes when $q>2$. The objective of this paper is to study some of the codes within this class. In particular, the dimension, the minimum distance, and the weight distribution of som"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07009","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":"1603.07009","created_at":"2026-05-18T01:00:45.813208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07009v2","created_at":"2026-05-18T01:00:45.813208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07009","created_at":"2026-05-18T01:00:45.813208+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVY32LO6URET","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVY32LO6URETPWSX","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVY32LO6","created_at":"2026-05-18T12:30:36.002864+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/OVY32LO6URETPWSXHTCCJQ2VCO","json":"https://pith.science/pith/OVY32LO6URETPWSXHTCCJQ2VCO.json","graph_json":"https://pith.science/api/pith-number/OVY32LO6URETPWSXHTCCJQ2VCO/graph.json","events_json":"https://pith.science/api/pith-number/OVY32LO6URETPWSXHTCCJQ2VCO/events.json","paper":"https://pith.science/paper/OVY32LO6"},"agent_actions":{"view_html":"https://pith.science/pith/OVY32LO6URETPWSXHTCCJQ2VCO","download_json":"https://pith.science/pith/OVY32LO6URETPWSXHTCCJQ2VCO.json","view_paper":"https://pith.science/paper/OVY32LO6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07009&json=true","fetch_graph":"https://pith.science/api/pith-number/OVY32LO6URETPWSXHTCCJQ2VCO/graph.json","fetch_events":"https://pith.science/api/pith-number/OVY32LO6URETPWSXHTCCJQ2VCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVY32LO6URETPWSXHTCCJQ2VCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVY32LO6URETPWSXHTCCJQ2VCO/action/storage_attestation","attest_author":"https://pith.science/pith/OVY32LO6URETPWSXHTCCJQ2VCO/action/author_attestation","sign_citation":"https://pith.science/pith/OVY32LO6URETPWSXHTCCJQ2VCO/action/citation_signature","submit_replication":"https://pith.science/pith/OVY32LO6URETPWSXHTCCJQ2VCO/action/replication_record"}},"created_at":"2026-05-18T01:00:45.813208+00:00","updated_at":"2026-05-18T01:00:45.813208+00:00"}