Self-orthogonal and quantum codes over chain rings
DOI:
https://doi.org/10.13069/jacodesmath.v11i2.304Keywords:
Gray map, Self-orthogonal code, Quantum code, Quasi-twisted code, Griesmer codeAbstract
In this paper, we investigate the Gray images of codes over chain rings, leading to the derivation of infinite families of self-orthogonal linear codes over the residue field $\mathbb{F}_q$. We determine the parameters of optimal self-orthogonal and divisible linear codes. Additionally, we study the Gray images of quasi-twisted codes, resulting in some self-orthogonal Griesmer quasi-cyclic codes. Finally, we employ the CSS construction to derive some quantum codes based on self-orthogonal linear codes.
Received: 19 September 2023 | Accepted: 18 January 2024Downloads
References
E. F. Assmus and J. D. Key, Polynomial codes and finite geometries, in: Handbook of Coding Theory, 2 (1998) 1269–1343.
A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A 54(2) (1996) 1098–1105.
C. Carlet, $\mathbb{Z}_{2^k}$-linear codes, IEEE Trans. Inform. Theory 44(4) (1998) 1543–1547.
E. Z. Chen, Online database of Quasi-Twisted Codes, Available online at: http://databases.cs.hkr.se/qtcodes/searchqc2.php.
I. Constantinescu and W. Heise, A metric for codes over residue class rings, Probl. Peredachi Inf. 33(3) (1997) 22–28.
M. Greferath and M. E. O'Sullivan, On bounds for codes over Frobenius rings under homogeneous weights, Discrete Math. 289(1-3) (2004) 11–24.
M. Grassl, Bounds on the minimum distance of linear codes and quantum codes, (2007), Online available at: http://www.codetables.de/.
M. Greferath and S. E. Schmidt, Gray isometries for finite chain rings and a nonlinear ternary $(36, 3^{12}, 15)$ code, IEEE Trans. Inform. Theory 45(7) (1999) 2522–2524.
A. R. Hammons, P. V. Kumar, A. R. Calderbank, N. J. Sloane, and P. Solé, The $\mathbb{Z}_4$-linearity of Kerdock, Preparata, Goethals, and related codes, IEEE Trans. Inform. Theory 40(2) (1994) 301–319.
S. Jitman and P. Udomkavanich, The Gray image of codes over finite chain rings, Int. J. Contemp. Math. Sci. 5(10) (2010) 449–458.
T. Kasami, S. Lin, and W. Peterson, New generalizations of the Reed-Muller codes part I: primitive codes, IEEE Trans. Inform. Theory 14(2) (1968) 189–199.
D. A. Lidar and T. A. Brun (Eds.), Quantum Error Correction, Cambridge University Press, 2013.
S. Ling and J. T. Blackford, $\mathbb{Z}_{p^{k+1}}$-linear codes, IEEE Trans. Inform. Theory 48(9) (2002) 2592–2605.
G. Norton and A. Sălăgean, On the Hamming distance of linear codes over a finite chain ring, IEEE Trans. Inform. Theory 46(3) (2000) 1060–1067.
G. Norton and A. Sălăgean, On the structure of linear and cyclic codes over a finite chain ring, Appl. Algebra Engrg. Comm. Comput. 10(6) (2000) 489–506.
P. W. Shor, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A 52(4) (1995) R2493–R2496.
A. Steane, Multiple-particle interference and quantum error correction, Proc. R. Soc. Lond. A 452(1954) (1996) 2551–2577.
A. M. Steane, Simple quantum error-correcting codes, Phys. Rev. A 54(6) (1996) 4741–4751.
B. Yildiz and I. G. Kelebek, The homogeneous weight for $R_k$, related Gray map and new binary quasi-cyclic codes, Filomat 31(4) (2017) 885–897.
