$t$-Frobenius Negacyclic Codes
Priyabrata Bag, Santanu Dey

TL;DR
This paper introduces and classifies a new class of quantum negacyclic codes called $t$-Frobenius negacyclic codes over finite fields, providing construction criteria, extending BCH distance, and identifying new codes.
Contribution
It defines $t$-Frobenius negacyclic codes, provides a complete classification, and extends BCH distance to these codes, advancing quantum code theory.
Findings
Complete classification of $t$-Frobenius negacyclic codes.
Construction criteria based on cyclotomic ring ideals.
Identification of new codes using extended BCH distance.
Abstract
Let denote the finite field of order , where is an odd prime. We study certain quantum negacyclic codes over which we call -Frobenius negacyclic codes. We obtain a criterion for constructing such codes from certain subspaces of in terms of generating pairs of ideals of cyclotomic rings and we completely classify all linear -Frobenius negacyclic codes. Further, the notion of BCH distance is extended for these codes and several new codes are identified.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Quantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata
