Binary construction of quantum codes of minimum distances five and six
β Scribed by Ruihu Li; Xueliang Li
- Book ID
- 108113813
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 171 KB
- Volume
- 308
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In 1996 Rosenthal and York proposed (timeβinvariant) BCH convolutional codes [4] in which the parity check matrix of a BCH code is used in the construction of the convolutional code. The lower bound on the minimum free distance of a BCH convolutional code is guaranteed by the BCH limit.
The coset graph of a nondegenerate cyclic code is orbital regular. This yields a lower bound on its average distance, a parameter which measures the average distortion of a code used in data compression. Using results of Shahrokhi and Sz&kely we generalize this bound to binary codes with a transitiv