Quantum LDPC codes with positive rate and minimum distance proportional to $n^{1/2}$
Langue
en
Communication dans un congrès
Ce document a été publié dans
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
Résumé en anglais
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 ...Lire la suite >