{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:YUXGIZJFSHSVJNGYPC7VQI7323","short_pith_number":"pith:YUXGIZJF","schema_version":"1.0","canonical_sha256":"c52e64652591e554b4d878bf5823fbd6ee21180d1d602e8a8b40cb89cfbaeca7","source":{"kind":"arxiv","id":"2210.08463","version":1},"attestation_state":"computed","paper":{"title":"Two classes of narrow-sense BCH codes and their duals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chengju Li, Jiaojiao Wang, Xiaoqiang Wang, Yansheng Wu","submitted_at":"2022-10-16T06:41:57Z","abstract_excerpt":"BCH codes and their dual codes are two special subclasses of cyclic codes and are the best linear codes in many cases. A lot of progress on the study of BCH cyclic codes has been made, but little is known about the minimum distances of the duals of BCH codes. Recently, a new concept called dually-BCH code was introduced to investigate the duals of BCH codes and the lower bounds on their minimum distances in \\cite{GDL21}. For a prime power $q$ and an integer $m \\ge 4$, let $n=\\frac{q^m-1}{q+1}$ \\ ($m$ even), or $n=\\frac{q^m-1}{q-1}$ \\ ($q>2$).\n  In this paper, some sufficient and necessary cond"},"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":"2210.08463","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-10-16T06:41:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d83748c748094fbfff731f115be6370d353736bedd203476073d1b649f192fd0","abstract_canon_sha256":"c82da8f1cfab7d6b8321ceabdc5d8da30fa4d0c46709350ca72a3aa065a775ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:07:11.262890Z","signature_b64":"A//wapPI+ABuF8wWCLaf+YsG52g862LyvIERs0LJu3JVh4Q+SorOL0WfRXDyjQb9aVWEICzvujANhTi52WJOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c52e64652591e554b4d878bf5823fbd6ee21180d1d602e8a8b40cb89cfbaeca7","last_reissued_at":"2026-07-05T05:07:11.262465Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:07:11.262465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two classes of narrow-sense BCH codes and their duals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chengju Li, Jiaojiao Wang, Xiaoqiang Wang, Yansheng Wu","submitted_at":"2022-10-16T06:41:57Z","abstract_excerpt":"BCH codes and their dual codes are two special subclasses of cyclic codes and are the best linear codes in many cases. A lot of progress on the study of BCH cyclic codes has been made, but little is known about the minimum distances of the duals of BCH codes. Recently, a new concept called dually-BCH code was introduced to investigate the duals of BCH codes and the lower bounds on their minimum distances in \\cite{GDL21}. For a prime power $q$ and an integer $m \\ge 4$, let $n=\\frac{q^m-1}{q+1}$ \\ ($m$ even), or $n=\\frac{q^m-1}{q-1}$ \\ ($q>2$).\n  In this paper, some sufficient and necessary cond"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.08463","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.08463/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.08463","created_at":"2026-07-05T05:07:11.262529+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.08463v1","created_at":"2026-07-05T05:07:11.262529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.08463","created_at":"2026-07-05T05:07:11.262529+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUXGIZJFSHSV","created_at":"2026-07-05T05:07:11.262529+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUXGIZJFSHSVJNGY","created_at":"2026-07-05T05:07:11.262529+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUXGIZJF","created_at":"2026-07-05T05:07:11.262529+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/YUXGIZJFSHSVJNGYPC7VQI7323","json":"https://pith.science/pith/YUXGIZJFSHSVJNGYPC7VQI7323.json","graph_json":"https://pith.science/api/pith-number/YUXGIZJFSHSVJNGYPC7VQI7323/graph.json","events_json":"https://pith.science/api/pith-number/YUXGIZJFSHSVJNGYPC7VQI7323/events.json","paper":"https://pith.science/paper/YUXGIZJF"},"agent_actions":{"view_html":"https://pith.science/pith/YUXGIZJFSHSVJNGYPC7VQI7323","download_json":"https://pith.science/pith/YUXGIZJFSHSVJNGYPC7VQI7323.json","view_paper":"https://pith.science/paper/YUXGIZJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.08463&json=true","fetch_graph":"https://pith.science/api/pith-number/YUXGIZJFSHSVJNGYPC7VQI7323/graph.json","fetch_events":"https://pith.science/api/pith-number/YUXGIZJFSHSVJNGYPC7VQI7323/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUXGIZJFSHSVJNGYPC7VQI7323/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUXGIZJFSHSVJNGYPC7VQI7323/action/storage_attestation","attest_author":"https://pith.science/pith/YUXGIZJFSHSVJNGYPC7VQI7323/action/author_attestation","sign_citation":"https://pith.science/pith/YUXGIZJFSHSVJNGYPC7VQI7323/action/citation_signature","submit_replication":"https://pith.science/pith/YUXGIZJFSHSVJNGYPC7VQI7323/action/replication_record"}},"created_at":"2026-07-05T05:07:11.262529+00:00","updated_at":"2026-07-05T05:07:11.262529+00:00"}