Title :
Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound
Author :
Chen, Hao ; Ling, San ; Xing, Chaoping
Author_Institution :
Dept. of Math., Zhongshan Univ., Guangzhou, China
fDate :
7/1/2001 12:00:00 AM
Abstract :
It is known that quantum error correction can be achieved using classical binary codes or additive codes over F4. Asymptotically good quantum codes have been constructed from algebraic-geometry codes and a bound on (δ, R) was computed from the Tsfasman-Vladut-Zink bound of the theory of classical algebraic-geometry codes. In this correspondence, by the use of a concatenation technique we construct a family of asymptotically good quantum codes exceeding the bound in a small interval
Keywords :
algebraic geometric codes; binary codes; concatenated codes; error correction codes; quantum communication; Ashikhmin-Litsyn-Tsfasman bound; Tsfasman-Vladut-Zink bound; additive codes; algebraic-geometry codes; asymptotically good quantum codes; classical binary codes; concatenation technique; quantum error correction; Binary codes; Cascading style sheets; Chaos; Computer science; Concatenated codes; Equations; Error correction codes; Mathematics; Quantum computing; Quantum mechanics;
Journal_Title :
Information Theory, IEEE Transactions on