Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}

Details Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2} Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}

2009-03-03

arxiv.org/abs/0903.0566v1

Computer Science

Information Theory

13 pages

Scientific paper

The current best asymptotic lower bound on the minimum distance of quantum
LDPC codes with fixed non-zero rate is logarithmic in the blocklength. We
propose a construction of quantum LDPC codes with fixed non-zero rate and prove
that the minimum distance grows proportionally to the square root of the
blocklength.

Affiliated with

Also associated with

No associations

Rating

Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2} does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2} will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-653465