
Quantum Generalized Reed-Solomon codes
Author(s) -
Zhuo Li,
Lijuan Xing
Publication year - 2008
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.57.28
Subject(s) - reed–solomon error correction , prime power , prime (order theory) , quantum , discrete mathematics , block code , reed–muller code , physics , mathematics , computer science , concatenated error correction code , combinatorics , quantum mechanics , algorithm , decoding methods
We construct a family of quantum error-correcting codes with parameters nn-2kk+1q which are defined in q-dimensional quantum systemswhere q is an arbitrary prime power. These codes are optimal in the sense that the minimum distance is maximal. It is shown that codes exist for all n satisfying 2≤n≤q or q2-q+2≤n≤q2.