Jump to content

Enumerator polynomial

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Vanish2 (talk | contribs) at 10:18, 11 July 2008 (reworded intro, added distance enumerator, added van lint ref). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, the weight enumerator polynomial of a binary linear code specifies the number of words of each possible Hamming weight.

Let be a binary linear code length . The weight distribution is the sequence of numbers

giving the number of codewords c in C having weight t as t ranges from 0 to n. The weight enumerator is the bivariate polynomial


Basic properties

MacWilliams identity

Denote the dual code of by

(where denotes the vector dot product and which is taken over ).

The MacWilliams identity states that

The identity is named after Jessie MacWilliams.

Distance enumerator

The distance distribution or inner distribution of a code C of size M and length n is the sequence of numbers

where i ranges from 0 to n. The distance enumerator polynomial is

and when C is linear this is equal to the weight enumerator.

References

  • Hill, Raymond (1986). A first course in coding theory. Oxford Applied Mathematics and Computing Science Series. Oxford University Press. pp. 165–173. ISBN 0-19-853803-0.
  • Pless, Vera (1982). Introduction to the theory of error-correcting codes. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons. pp. 103–119. ISBN 0-471-08684-3.
  • J.H. van Lint (1992). Introduction to Coding Theory. GTM. Vol. 86 (2nd ed ed.). Springer-Verlag. ISBN 3-540-54894-7. {{cite book}}: |edition= has extra text (help) Chapters 3.5 and 4.3.