2 research outputs found
A Construction of Quantum Codes via A Class of Classical Polynomial Codes
There have been various constructions of classical codes from polynomial
valuations in literature \cite{ARC04, LNX01,LX04,XF04,XL00}. In this paper, we
present a construction of classical codes based on polynomial construction
again. One of the features of this construction is that not only the classical
codes arisen from the construction have good parameters, but also quantum codes
with reasonably good parameters can be produced from these classical codes. In
particular, some new quantum codes are constructed (see Examples \ref{5.5} and
\ref{5.6})
Quantum Block and Synchronizable Codes Derived from Certain Classes of Polynomials
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.Comment: 9 pages. arXiv admin note: text overlap with arXiv:1403.6192,
arXiv:1311.3416 by other author