Abstract:
We consider subcodes of algebraic-geometrical codes over a prime subfield that generalize BCH codes and classical Goppa codes. The deviation of the weight distribution of such a subfield code from the weight distribution of a random code is estimated by two different techniques. If the code length is large compared with the genus of the curve and the degree of the divisor defining the code, then the distribution is close to the random-code distribution.