Shaanxi Xi'an, Editor
2013
Abstract In this paper, we use 4-cyclotomic cosets of modulo n and generator polynomials to describe quaternary simple-root cyclic codes of length n = 85. We discuss the conditions under which a quaternary cyclic codes contain its dual, and obtain some quantum error-correcting codes of length n = 85, three of these codes are better than previous known codes. Keywords Quaternary cyclic code, self-orthogonal code, quantum error-correcting code. x1. Introduction Since the initial discovery of quantum error-correcting codes, researchers have made great progress in developing quantum error-correcting codes. Many code construction are given. Reference [1] gives a thorough discussion of the principles of quantum coding theory. Many good quantum error-correcting codes were constructed from BCH codes, Reed-Muller codes, Reed-Solomon codes and algebraic geometric codes, see [2-6]. So it is natural to construct quantum error-correcting codes from quaternary cyclic codes. It is known that there is a close relation between cyclotomic coset and cyclic codes. Suggested by this relation, we use 4-cyclotomic coset modulo n and generator polynomials to describe self-orthogonal cyclic codes and their dual codes. This paper is organized as follows. In this section, we introduce some definition and do some preparation for further discussion. In section 2, we construct quaternary cyclic codes of length 85 and related quantum error-correcting codes. In section 3, we compare the parameters of our quantum error-correcting codes and related cyclic codes with previously known.
Read this work at the World Public Library (library card needed).