On the Complete Weight Enumerator of Reed-Solomon Codes
Ian F. Blake, Khun Kith · SIAM Journal on Discrete Mathematics · 1991
The complete weight enumerator of a code enumerates the code words by the number of symbols of each kind contained in each code word. As for the ordinary weight enumerators, the complete weight enumerators for linear codes satisfy a duality theorem. These weight enumerators are studied here for certain realizations of Reed–Solomon codes of dimensions two, three, and four over a field of characteristic two. Some applications of these results are considered.