Quantum Codes from additive constacyclic codes over a mixed alphabet and the MacWilliams identities
Abstract
Let Zp be the ring of integers modulo a prime number p where p-1 is a quadratic residue modulo p. This paper presents the study of constacyclic codes over chain rings R=Zp[u] u2 and S=Zp[u] u3. We also study additive constacyclic codes over RS and ZpRS using the generator polynomials over the rings R and S, respectively. Further, by defining Gray maps on R, S and ZpRS, we obtain some results on the Gray images of additive codes. Then we give the weight enumeration and MacWilliams identities corresponding to the additive codes over ZpRS. Finally, as an application of the obtained codes, we give quantum codes using the CSS construction.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.