Home  

Random  

Nearby  



Log in  



Settings  



Donate  



About Wikipedia  

Disclaimers  



Wikipedia





Enumerator polynomial





Article  

Talk  



Language  

Watch  

Edit  





Incoding theory, 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 cinC having weight tast ranges from 0 to n. The weight enumerator is the bivariate polynomial

Basic properties

edit
  1.  
  2.  
  3.  
  4.  

MacWilliams identity

edit

Denote the dual codeof 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

edit

The distance distributionorinner 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 polynomialis

 

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

The outer distributionofC is the 2n-by-n+1 matrix B with rows indexed by elements of GF(2)n and columns indexed by integers 0...n, and entries

 

The sum of the rows of BisM times the inner distribution vector (A0,...,An).

A code Cisregular if the rows of B corresponding to the codewords of C are all equal.

References

edit

Retrieved from "https://en.wikipedia.org/w/index.php?title=Enumerator_polynomial&oldid=1181598138"
 



Last edited on 24 October 2023, at 01:35  





Languages

 


Русский
 

Wikipedia


This page was last edited on 24 October 2023, at 01:35 (UTC).

Content is available under CC BY-SA 4.0 unless otherwise noted.



Privacy policy

About Wikipedia

Disclaimers

Contact Wikipedia

Code of Conduct

Developers

Statistics

Cookie statement

Terms of Use

Desktop