On the dimension of subfield subcodes
Henning Stichtenoth · IEEE Transactions on Information Theory · 1990
A new lower bound for the dimension of a subfield subcode is given. This bound improves the well-known lower bound of P. Delsarte (1975) and coincides in many cases with the true dimension of the code. Alternant codes and geometric Goppa codes are discussed as special cases.>