{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UW2CHEZ246LSKFOC7MZR33Q4OL","short_pith_number":"pith:UW2CHEZ2","schema_version":"1.0","canonical_sha256":"a5b423933ae7972515c2fb331dee1c72da1d0554c60fe16150167e242fe07d09","source":{"kind":"arxiv","id":"2301.06446","version":1},"attestation_state":"computed","paper":{"title":"Five infinite families of binary cyclic codes and their related codes with good parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chengju Li, Cunsheng Ding, Hai Liu","submitted_at":"2023-01-16T14:37:52Z","abstract_excerpt":"Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in IEEE Trans. Inf. Theory, vol. 68, no. 12, pp. 7842-7849, 2022, the objectives of this paper are the construction and analyses of five infinite families of binary cyclic codes with parameters $[n, k]$ and $(n-6)/3 \\leq k \\leq 2(n+6)/3$. Three of the five families of binary cyclic codes and their duals have a very good lower bound on their minimum distances and "},"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":"2301.06446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-01-16T14:37:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"08bea4ed74a8ebe95381612e832ee1bd0008eefa2c7fccae89423a5c998c53fa","abstract_canon_sha256":"27dd0207bc360e1d757ebe29881cdb9ae36f8c1a1d14e9867f0d9aa48361e0fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:33:31.665932Z","signature_b64":"N/9ycUEJz/vqtclA6eWkQiO0w2efr9NdEc7uvMYeQl1uxvewOfggFeMcppdjqlthpUbBX690H0zsMk1egK3qAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5b423933ae7972515c2fb331dee1c72da1d0554c60fe16150167e242fe07d09","last_reissued_at":"2026-07-05T05:33:31.665309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:33:31.665309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Five infinite families of binary cyclic codes and their related codes with good parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chengju Li, Cunsheng Ding, Hai Liu","submitted_at":"2023-01-16T14:37:52Z","abstract_excerpt":"Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in IEEE Trans. Inf. Theory, vol. 68, no. 12, pp. 7842-7849, 2022, the objectives of this paper are the construction and analyses of five infinite families of binary cyclic codes with parameters $[n, k]$ and $(n-6)/3 \\leq k \\leq 2(n+6)/3$. Three of the five families of binary cyclic codes and their duals have a very good lower bound on their minimum distances and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.06446","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/2301.06446/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":"2301.06446","created_at":"2026-07-05T05:33:31.665402+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.06446v1","created_at":"2026-07-05T05:33:31.665402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.06446","created_at":"2026-07-05T05:33:31.665402+00:00"},{"alias_kind":"pith_short_12","alias_value":"UW2CHEZ246LS","created_at":"2026-07-05T05:33:31.665402+00:00"},{"alias_kind":"pith_short_16","alias_value":"UW2CHEZ246LSKFOC","created_at":"2026-07-05T05:33:31.665402+00:00"},{"alias_kind":"pith_short_8","alias_value":"UW2CHEZ2","created_at":"2026-07-05T05:33:31.665402+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/UW2CHEZ246LSKFOC7MZR33Q4OL","json":"https://pith.science/pith/UW2CHEZ246LSKFOC7MZR33Q4OL.json","graph_json":"https://pith.science/api/pith-number/UW2CHEZ246LSKFOC7MZR33Q4OL/graph.json","events_json":"https://pith.science/api/pith-number/UW2CHEZ246LSKFOC7MZR33Q4OL/events.json","paper":"https://pith.science/paper/UW2CHEZ2"},"agent_actions":{"view_html":"https://pith.science/pith/UW2CHEZ246LSKFOC7MZR33Q4OL","download_json":"https://pith.science/pith/UW2CHEZ246LSKFOC7MZR33Q4OL.json","view_paper":"https://pith.science/paper/UW2CHEZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.06446&json=true","fetch_graph":"https://pith.science/api/pith-number/UW2CHEZ246LSKFOC7MZR33Q4OL/graph.json","fetch_events":"https://pith.science/api/pith-number/UW2CHEZ246LSKFOC7MZR33Q4OL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UW2CHEZ246LSKFOC7MZR33Q4OL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UW2CHEZ246LSKFOC7MZR33Q4OL/action/storage_attestation","attest_author":"https://pith.science/pith/UW2CHEZ246LSKFOC7MZR33Q4OL/action/author_attestation","sign_citation":"https://pith.science/pith/UW2CHEZ246LSKFOC7MZR33Q4OL/action/citation_signature","submit_replication":"https://pith.science/pith/UW2CHEZ246LSKFOC7MZR33Q4OL/action/replication_record"}},"created_at":"2026-07-05T05:33:31.665402+00:00","updated_at":"2026-07-05T05:33:31.665402+00:00"}