$ m $-QMDS codes over mixed alphabets via orthogonal arrays
Mengqian Chen, Shanqi Pang, Rong Yan +1 more
The construction of quantum error-correcting codes (QECCs) with good parameters is a hot topic in the area of quantum information and quantum computing. Quantum maximum distance separable (MDS) codes are optimal because the minimum distance cannot be improved for given length, dimension, and alphabet sizes. Quantum MDS codes over mixed alphabets are scarcely studied, and even the existence and construction of QECCs over mixed alphabets with a minimum distance of at least three remain an open question. In this paper, we define an $ m $-QMDS code over mixed alphabets, which is a generalization of quantum MDS (QMDS) codes. We establish a relation between such codes and asymmetric orthogonal arrays with orthogonal partitions. This relation is used for the construction of $ m $-QMDS codes with varying local dimension, length, and minimum distance. As applications of this method, numerous infinite families of $ m $-QMDS codes over mixed alphabets can be constructed explicitly. The constructed codes not only have more flexibility in the choice of parameters than other models but also possess better error correction capability and encoding efficiency.
arXiv:2406.10629•AIMS Mathematics•Jan 1, 2026•0 citations