Learn More
In coding theory, self-dual codes and cyclic codes are important classes of codes which have been extensively studied. The main objects of study in this paper are self-dual cyclic codes over finite fields, i.e., the intersection of these two classes. We show that self-dual cyclic codes of length <i>n</i> over \BBF<i>q</i> exist if and only if <i>n</i> is(More)
Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. 2055 REFERENCES [1] G. F. M.(More)
In this paper, we first construct several classes of classical Hermitian self-orthogonal maximum distance separable (MDS) codes. Through these classical codes, we are able to obtain various quantum MDS codes. It turns out that many of our quantum codes are new in the sense that the parameters of our quantum codes cannot be obtained from all previous(More)
We generalize a characterization of p-ary (p is a prime) quantum codes given by Feng and Xing to q-ary (q is a prime power) quantum codes. This characterization makes it possible to convert an asymptotic bound of Stichtenoth and Xing for nonlinear algebraic geometry codes to a quantum asymptotic bound. Besides, we also investigate the asymptotic behavior of(More)
The Gilbert-Varshamov (GV) bound for asymptotic families of codes over F/sub q/ has been improved by Tsfasman, Vla/spl breve/dut$80, and Zink (TVZ) in 1982, and only recently further improvements have been obtained by Xing, Elkies, and Niederreiter-O/spl uml/zbudak, by considering also nonlinear codes. These improvements involve higher derivations in(More)