Quantum Block and Synchronizable Codes Derived from Certain Classes of Polynomials
Information Theory
2015-08-06 v1 math.IT
Abstract
One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical codes, we are able to obtain some new quantum codes. It turns out that some of quantum codes exhibited here have better parameters than the ones available in the literature. Meanwhile, we give a new class of quantum synchronizable codes with highest possible tolerance against misalignment from duadic codes.
Cite
@article{arxiv.1508.00974,
title = {Quantum Block and Synchronizable Codes Derived from Certain Classes of Polynomials},
author = {Tao Zhang and Gennian Ge},
journal= {arXiv preprint arXiv:1508.00974},
year = {2015}
}
Comments
9 pages. arXiv admin note: text overlap with arXiv:1403.6192, arXiv:1311.3416 by other authors