The average binary weight-enumerator for a class of generalized Reed-Solomon codes

C.T. Retter

IEEE Transactions on Information Theory · 1991 · 43 citations · 7 references

Concepts

Abstract

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

References

7