Quantum LDPC codes with positive rate and minimum distance proportional to $n^{1/2}$
Language
en
Communication dans un congrès
This item was published in
Proceedings of the IEEE Symposium on Information Theory, ISIT 2009, Proceedings of the IEEE Symposium on Information Theory, ISIT 2009, IEEE Symposium on Information Theory, ISIT 2009, 2009, Seoul. 2009p. 799--804
English Abstract
The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with fixed nonzero rate is logarithmic in the blocklength. We build quantum LDPC codes with fixed non-zero rate and prove that their ...Read more >
The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with fixed nonzero rate is logarithmic in the blocklength. We build quantum LDPC codes with fixed non-zero rate and prove that their minimum distance grows proportionally to the square root of the blocklength.Read less <
Origin
Hal imported