Quantum error-correcting codes over finite Frobenius rings
From MaRDI portal
Recommendations
Cites work
- Characterization of finite Frobenius rings
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Duality for modules over finite rings and applications to coding theory
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 107550 (Why is no real title available?)
- scientific article; zbMATH DE number 1236965 (Why is no real title available?)
- scientific article; zbMATH DE number 3387482 (Why is no real title available?)
- On admissible rings
- On isodual cyclic codes over finite chain rings
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- QUADRATIC RESIDUE CODES OVER ℤ9
- Quantum Error Correction and Orthogonal Geometry
Cited in
(7)- On bounds for quantum error correcting codes over EJ-integers
- On quantum stabilizer codes derived from local Frobenius rings
- Quantum codes over rings
- scientific article; zbMATH DE number 6375898 (Why is no real title available?)
- The multiplicative domain in quantum error correction
- Quantum error correction via codes over GF(4)
- The Bush matrix over a Galois field and error correcting quantum codes
This page was built for publication: Quantum error-correcting codes over finite Frobenius rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296044)