Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum Codes from additive constacyclic codes over a mixed alphabet and the MacWilliams identities

Published 26 Dec 2022 in cs.IT and math.IT | (2212.13169v1)

Abstract: Let Zp\mathbb{Z}_p be the ring of integers modulo a prime number pp where p−1p-1 is a quadratic residue modulo pp. This paper presents the study of constacyclic codes over chain rings R=Zp[u]⟨u<sup>2⟩\mathcal{R}=\frac{\mathbb{Z}_p[u]}{\langle u<sup>2\rangle} and S=Zp[u]⟨u<sup>3⟩\mathcal{S}=\frac{\mathbb{Z}_p[u]}{\langle u<sup>3\rangle}. We also study additive constacyclic codes over RS\mathcal{R}\mathcal{S} and ZpRS\mathbb{Z}_p\mathcal{R}\mathcal{S} using the generator polynomials over the rings R\mathcal{R} and S,\mathcal{S}, respectively. Further, by defining Gray maps on R\mathcal{R}, S\mathcal{S} and ZpRS,\mathbb{Z}_p\mathcal{R}\mathcal{S}, 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\mathbb{Z}_p\mathcal{R}\mathcal{S}. Finally, as an application of the obtained codes, we give quantum codes using the CSS construction.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.