The average binary weight-enumerator for a class of generalized Reed-Solomon codes
CHARLES T. RETTER · IEEE Transactions on Information Theory · 1991
An explicit weight-enumerator for the set of binary expansions of a class of generalized Reed-Solomon codes is derived. This enumerator is then used to show that most of these binary codes are asymptotically good, and to bound the rates of self-intersecting codes.>