Abstract
A polynomial construction of quantum codes with asymptotically nonzero rate and relative distance was presented using algebraic geometry codes. The generator matrix of the sympletic code was used to construct a polynomial complexity encoder, which is a sequence of Gaussian elimination of k×n matrices. It was shown that generator matrices of algebraic geometry codes can be constructed in polynomial time.
| Original language | English |
|---|---|
| Article number | 032311 |
| Pages (from-to) | 1-5 |
| Number of pages | 5 |
| Journal | Physical Review A - Atomic, Molecular, and Optical Physics |
| Volume | 63 |
| Issue number | 3 |
| DOIs | |
| State | Published - Mar 2001 |