Asymptotically good families of geometric Goppa codes and the Gilbert-Varshamov bound (Q4950440)

One interesting application of geometric Goppa codes is the construction of asymptotically good families of codes. In Section 1 we show that almost all long linear codes are good ones in the sense that they get close to the Gilbert-Varshamov bound. In Section 2 we present the main result of our joint work with \textit{H. Stichtenoth} [ Geom. Dedicata 33, No. 1, 111-116 (1990)], which gave a generalization of the well-known fact that classical Goppa codes meet the Gilbert-Varshamov bound. Finally, in Section 3 we show the main result of this note, namely that the sequences of codes considered in the above-cited paper are often asymptotically good ones. For the entire collection see [Zbl 0755.94003].