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 F q , for all squares q=l 2 . 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 E 0 subeE 1 subeE 2 sube middotmiddotmiddot of function fields over F q (with q=lscr 2 ), where all extensions E n /E 0 are Galois
No takes yet. Share an insight, caveat, or question.
Henning Stichtenoth (2006) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: