On quantum stabilizer codes derived from local Frobenius rings
This paper generalize some results on quantum stabilizer codes over finite chain rings to finite local commutative Frobenius rings. Authors showed that a free stabilizer code of finite dimension is symplectically isometric to a free self-orthogonal code and gave its symplectic dual which is also free. Generator matrices in standard form for these codes are also provided. They proved that for a free stabilizer code, the minimum distance is equal to the minimum distance of its reduction, and the relative minimum distance is always at most the relative minimum distance of its reduction. However authors conjectured that these two relative minimum distances are equal for free stabilizer codes. Many examples are provided to illustrate the comparison between minimum and relative minimum distance of a stabilizer code over a finite local Frobenius ring to minimum and relative minimum distance over its reduction. For a finite local Frobenius ring \(R\), they proved that every symplectic isometry \(f\colon R^{2n} \to R^{2n}\) is a monomial map; and showed that symplectic isometries between stabilizer codes does not necessarily extend to such isometries on the entire space. This led authors to provide some open problems.
- Quantum codes from constacyclic codes over a semi-local ring
- Quantum error-correcting codes over finite Frobenius rings
- Quantum codes from a class of constacyclic codes over finite commutative rings
- Quantum codes from codes over the ring R_q
- Quantum codes from codes over the ring \(\mathbb{F}_q + \alpha\mathbb{F}_q\)
- Quantum codes over rings
- Quantum codes from linear codes over finite chain rings
- Quantum codes from cyclic codes over ring F_q+u F_q
- On quantum codes from cyclic codes over a class of nonchain rings
- QUANTUM CODES FROM CYCLIC CODES OVER FINITE RING
- A field-like property of finite rings
- Characterization of finite Frobenius rings
- Duality for modules over finite rings and applications to coding theory
- FOUNDATIONS OF LINEAR CODES DEFINED OVER FINITE MODULES: THE EXTENSION THEOREM AND THE MACWILLIAMS IDENTITIES
- scientific article; zbMATH DE number 1236965 (Why is no real title available?)
- scientific article; zbMATH DE number 3286953 (Why is no real title available?)
- Isometry groups of additive codes over finite fields
- Nonbinary quantum stabilizer codes
- Nonbinary Stabilizer Codes Over Finite Fields
- On admissible rings
- On the Hamming distance of linear codes over a finite chain ring
- Quantum Error Correction and Orthogonal Geometry
- Quantum error correction via codes over GF(4)
- Symplectic isometries of stabilizer codes
- Über I‐reguläre Ringe, reguläre Ideale und Erklärungsmoduln. I
- Kitaev's stabilizer code and chain complex theory of bicommutative Hopf algebras
- \(\mathbb{F}_q\)-linear skew cyclic codes over \(\mathbb{F}_{q^2}\) and their applications of quantum codes construction
- Stabilizer quantum codes defined by trace-depending polynomials
- scientific article; zbMATH DE number 6492464 (Why is no real title available?)
- scientific article; zbMATH DE number 5568625 (Why is no real title available?)
- Symplectic isometries of stabilizer codes
- Symplectically self-orthogonal additive codes and their applications to quantum stabilizer codes
This page was built for publication: On quantum stabilizer codes derived from local Frobenius rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2422192)