Title :
Quantum LDPC codes with positive rate and minimum distance proportional to n½
Author :
Tillich, Jean-Pierre ; Zémor, Gilles
Author_Institution :
Projet Secret, INRIA, Le Chesnay, France
fDate :
June 28 2009-July 3 2009
Abstract :
The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with fixed non-zero rate is logarithmic in the block length. We build quantum LDPC codes with fixed non-zero rate and prove that their minimum distance grows proportionally to the square root of the block length.
Keywords :
graph theory; parity check codes; asymptotic lower bound; block length; fixed nonzero rate; minimum distance; positive rate; quantum LDPC codes; Computer displays; Computer errors; Decoding; Delay effects; Error correction codes; Fault diagnosis; Parity check codes; Protection; Quantum computing; Quantum mechanics;
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
DOI :
10.1109/ISIT.2009.5205648
