Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction

Authors:
M. Hamada
Affiliations:
PRESTO, Japan Sci. & Technol. Agency, Kawaguchi
Venue:
IEEE Transactions on Information Theory
Year:
2008

Citing 0
Cited 6

A polynomial-time construction of self-orthogonal codes and applications to quantum error correction

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
New families of asymmetric quantum BCH codes

Quantum Information & Computation
Asymmetric quantum Reed-Solomon and generalized Reed-Solomon codes

Quantum Information Processing
On nonbinary quantum convolutional BCH codes

Quantum Information & Computation
Hermitian dual containing BCH codes and construction of new quantum codes

Quantum Information & Computation
Self-orthogonal codes with dual distance three and quantum codes with distance three over $$\mathbb F _5$$F5

Quantum Information Processing

Quantified Score

Hi-index	754.84

Visualization

Abstract

A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon-theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.