Abstract :
A major problem in coding theory is the question of whether the class of cyclic codes is asymptotically good. In this correspondence-as a generalization of cyclic codes-the notion of transitive codes is introduced (see Definition 1.4 in Section I), and it is shown that the class of transitive codes is asymptotically good. Even more, transitive codes attain the Tsfasman-Vlabrevedut$80-Zink bound over Fq, for all squares q=l2. It is also shown that self-orthogonal and self-dual codes attain the Tsfasman-Vlabrevedut$80-Zink bound, thus improving previous results about self-dual codes attaining the Gilbert-Varshamov bound. The main tool is a new asymptotically optimal tower E0subeE1 subeE2sube middotmiddotmiddot of function fields over Fq (with q=lscr2), where all extensions En/E0 are Galois
Keywords :
cyclic codes; dual codes; Gilbert-Varshamov bound; Tsfasman-Vladut-Zink bound; cyclic code; self-dual code; self-orthogonal code; transitive code; Error correction codes; Galois fields; Information rates; Linear code; Poles and towers; Upper bound; Asymptotically good codes; Tsfasman–VlĂduŢ–Zink bound; cyclic codes; self-dual codes; towers of function fields; transitive codes;