Quantum code construction from two classical codes D1[n,k1,d1] and D2[n,k2,d2] over the field Fpm ( p is prime and m is an integer) satisfying the dual containing criteria D⊥1⊂D2 using the Calderbank–Shor–Steane (CSS) framework is well-studied. We show that the generalization of the CSS framework for qubits to qudits yields two different classes of codes, namely, the Fp -linear CSS codes and the well-known Fpm -linear CSS codes based on the check matrix-based definition and the coset-based definition of CSS codes over qubits. Our contribution to this article are three-folds. 1) We study the properties of the Fp -linear and Fpm -linear CSS codes and demonstrate the tradeoff for designing codes with higher rates or better error detection and correction capability, useful for quantum systems. 2) For Fpm -linear CSS codes, we provide the explicit form of the check matrix and show that the minimum distances dx and dz are equal to d2 and d1 , respectively, if and only if the code is nondegenerate. 3) We propose two classes of quantum codes obtained from the codes D1 and D2 , where one code is an Fpl -linear code ( l divides m ) and the other code is obtained from a particular subgroup of the stabilizer group of the Fpm -linear CSS code. Within each class of codes, we demonstrate the tradeoff between higher rates and better error detection and correction capability.
For more about this transaction see link below.
https://ieeexplore.ieee.org/document/9431703