Asymmetric quantum codes: new codes from old
From MaRDI portal
Publication:2436412
Abstract: In this paper we extend to asymmetric quantum error-correcting codes (AQECC) the construction methods, namely: puncturing, extending, expanding, direct sum and the (u|u + v) construction. By applying these methods, several families of asymmetric quantum codes can be constructed. Consequently, as an example of application of quantum code expansion developed here, new families of asymmetric quantum codes derived from generalized Reed-Muller (GRM) codes, quadratic residue (QR), Bose-Chaudhuri-Hocquenghem (BCH), character codes and affine-invariant codes are constructed.
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1504668 (Why is no real title available?)
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- Additive Asymmetric Quantum Codes
- Asymmetric Quantum Codes: Characterization and Constructions
- Asymmetric quantum Reed-Solomon and generalized Reed-Solomon codes
- Asymmetric quantum codes: constructions, bounds and performance
- Clifford Code Constructions of Operator Quantum Error-Correcting Codes
- Elementary 2-group character codes
- Enlargement of Calderbank-Shor-Steane quantum codes
- From skew-cyclic codes to asymmetric quantum codes
- Fundamentals of Error-Correcting Codes
- New Quantum MDS Codes
- New families of asymmetric quantum BCH codes
- Nonbinary Stabilizer Codes Over Finite Fields
- Nonbinary quantum codes
- Nonbinary quantum stabilizer codes
- ON OPTIMAL QUANTUM CODES
- Pure asymmetric quantum MDS codes from CSS construction: a complete characterization
- QUANTUM DUADIC AND AFFINE-INVARIANT CODES
- Quantum error correction via codes over GF(4)
Cited in
(29)- Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
- Construction of quantum codes and asymmetric quantum codes from graphs
- Constructions of asymmetric quantum alternant codes
- From skew-cyclic codes to asymmetric quantum codes
- Euclidean and hyperbolic asymmetric topological quantum codes
- On the construction of asymmetric quantum codes
- New asymmetric quantum codes from matrix-product codes
- Inhomogeneous quantum codes. III: The asymmetric case
- The subfield metric and its application to quantum error correction
- New asymmetric quantum codes over \(\mathbf{F}_{q^2}\)
- Some families of asymmetric quantum codes and quantum convolutional codes from constacyclic codes
- Weight enumerators for nonbinary asymmetric quantum codes and their applications
- Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\)
- Symmetric and asymmetric quantum codes
- New optimal asymmetric quantum codes constructed from constacyclic codes
- New methods for constructing AEAQEC codes
- Quasi-cyclic constructions of asymmetric quantum error-correcting codes
- New asymmetric quantum codes over \(F_q\)
- Some families of optimal quantum codes derived from constacyclic codes
- Algebraic quantum synchronizable codes
- On the construction of optimal asymmetric quantum codes
- Xing-Ling codes, duals of their subcodes, and good asymmetric quantum codes
- New quantum codes from CSS codes
- New optimal asymmetric quantum codes and quantum convolutional codes derived from constacyclic codes
- On two problems of asymmetric quantum codes
- Some families of asymmetric quantum MDS codes constructed from constacyclic codes
- Good and asymptotically good quantum codes derived from algebraic geometry
- New optimal asymmetric quantum codes derived from negacyclic codes
- On optimal constacyclic codes
This page was built for publication: Asymmetric quantum codes: new codes from old
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2436412)
