On non-binary quantum repeated-root cyclic codes
From MaRDI portal
Recommendations
Cites work
- Application of Classical Hermitian Self-Orthogonal MDS Codes to Quantum MDS Codes
- Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction
- Constructions of new families of nonbinary CSS codes
- Enlargement of Calderbank-Shor-Steane quantum codes
- Error Correcting Codes in Quantum Theory
- Generalization of Steane's Enlargement Construction of Quantum Codes and Applications
- Nonbinary quantum codes
- Nonbinary quantum stabilizer codes
- Nonbinary Stabilizer Codes Over Finite Fields
- On binary constructions of quantum codes
- On Quantum and Classical BCH Codes
- On repeated-root cyclic codes
- QUANTUM CODES CONSTRUCTED FROM BINARY CYCLIC CODES
- Quantum Codes From Concatenated Algebraic-Geometric Codes
- Quantum Reed-Muller codes
- Quantum twisted codes
- Repeated-root constacyclic codes of length
- Repeated-root cyclic codes
- The minimum Hamming distance of cyclic codes of length 2p^s
Cited in
(10)- Improved constructions for nonbinary quantum BCH codes
- A construction of optimal nonbinary pure quantum stabilizer codes
- Non-binary quantum synchronizable codes based on cyclic codes over \(\mathrm{F}_q\)
- Nonbinary quantum Reed-Solomon codes
- Construction of quantum negacyclic BCH codes
- QUANTUM CODES CONSTRUCTED FROM BINARY CYCLIC CODES
- New quantum codes from dual-containing cyclic codes over finite rings
- Theory and Applications of Models of Computation
- Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
- New QEC and EAQEC codes from repeated-root cyclic codes of length \(10p^s\) over finite fields \(\mathbb{F}_{p^m} \)
This page was built for publication: On non-binary quantum repeated-root cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2925839)
