{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:77FLSDQTVUWLH3S5PGN42XFOTJ","short_pith_number":"pith:77FLSDQT","schema_version":"1.0","canonical_sha256":"ffcab90e13ad2cb3ee5d799bcd5cae9a6d0df794432fe6789a60ef0c62ab4ce5","source":{"kind":"arxiv","id":"1610.08206","version":1},"attestation_state":"computed","paper":{"title":"The reversible negacyclic codes over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Binbin Pang, Shixin Zhu, Zhonghua Sun","submitted_at":"2016-10-26T07:04:52Z","abstract_excerpt":"In this paper, by investigating the factor of the $x^n+1$, we deduce that the structure of the reversible negacyclic code over the finite field $\\mathbb{F}_{q}$, where $q$ is an odd prime power. Though studying $q-$cyclotomic cosets modulo $2n$, we obtain the parameters of negacyclic BCH code of length $n=\\frac{q^\\ell+1}{2}$ , $n=\\frac{q^m-1}{2(q-1)}$ and $n=\\frac{q^{t\\cdot2^\\tau}-1}{2(q^t+1)}$. Some optimal linear codes from negacyclic codes are given. Finally, we discuss a class of MDS LCD negacyclic codes."},"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":"1610.08206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-26T07:04:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"92c0d3fa2b13dfe10a7acfc9ec826e2a802ec6dfa660c04482d7a4b47630f383","abstract_canon_sha256":"b22a18968836c7ab8a9039afa2005407175f9847e3b74b3b11561f7f062135bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:08:15.537341Z","signature_b64":"3e8WxGndHAa133CPgqjMxkX7cseBvuNCXNwSwmu580VtnU9qTsP/OcpNnrRAR3+ibYcmzAZwb5zeJ9ztfVlOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffcab90e13ad2cb3ee5d799bcd5cae9a6d0df794432fe6789a60ef0c62ab4ce5","last_reissued_at":"2026-07-05T02:08:15.536772Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:08:15.536772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The reversible negacyclic codes over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Binbin Pang, Shixin Zhu, Zhonghua Sun","submitted_at":"2016-10-26T07:04:52Z","abstract_excerpt":"In this paper, by investigating the factor of the $x^n+1$, we deduce that the structure of the reversible negacyclic code over the finite field $\\mathbb{F}_{q}$, where $q$ is an odd prime power. Though studying $q-$cyclotomic cosets modulo $2n$, we obtain the parameters of negacyclic BCH code of length $n=\\frac{q^\\ell+1}{2}$ , $n=\\frac{q^m-1}{2(q-1)}$ and $n=\\frac{q^{t\\cdot2^\\tau}-1}{2(q^t+1)}$. Some optimal linear codes from negacyclic codes are given. Finally, we discuss a class of MDS LCD negacyclic codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08206","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/1610.08206/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":"1610.08206","created_at":"2026-07-05T02:08:15.536840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08206v1","created_at":"2026-07-05T02:08:15.536840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08206","created_at":"2026-07-05T02:08:15.536840+00:00"},{"alias_kind":"pith_short_12","alias_value":"77FLSDQTVUWL","created_at":"2026-07-05T02:08:15.536840+00:00"},{"alias_kind":"pith_short_16","alias_value":"77FLSDQTVUWLH3S5","created_at":"2026-07-05T02:08:15.536840+00:00"},{"alias_kind":"pith_short_8","alias_value":"77FLSDQT","created_at":"2026-07-05T02:08:15.536840+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/77FLSDQTVUWLH3S5PGN42XFOTJ","json":"https://pith.science/pith/77FLSDQTVUWLH3S5PGN42XFOTJ.json","graph_json":"https://pith.science/api/pith-number/77FLSDQTVUWLH3S5PGN42XFOTJ/graph.json","events_json":"https://pith.science/api/pith-number/77FLSDQTVUWLH3S5PGN42XFOTJ/events.json","paper":"https://pith.science/paper/77FLSDQT"},"agent_actions":{"view_html":"https://pith.science/pith/77FLSDQTVUWLH3S5PGN42XFOTJ","download_json":"https://pith.science/pith/77FLSDQTVUWLH3S5PGN42XFOTJ.json","view_paper":"https://pith.science/paper/77FLSDQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08206&json=true","fetch_graph":"https://pith.science/api/pith-number/77FLSDQTVUWLH3S5PGN42XFOTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/77FLSDQTVUWLH3S5PGN42XFOTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77FLSDQTVUWLH3S5PGN42XFOTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77FLSDQTVUWLH3S5PGN42XFOTJ/action/storage_attestation","attest_author":"https://pith.science/pith/77FLSDQTVUWLH3S5PGN42XFOTJ/action/author_attestation","sign_citation":"https://pith.science/pith/77FLSDQTVUWLH3S5PGN42XFOTJ/action/citation_signature","submit_replication":"https://pith.science/pith/77FLSDQTVUWLH3S5PGN42XFOTJ/action/replication_record"}},"created_at":"2026-07-05T02:08:15.536840+00:00","updated_at":"2026-07-05T02:08:15.536840+00:00"}