Skip to search formSkip to main contentSkip to account menu

Enumerator polynomial

Known as: Distribution, Enumerator, McWilliam's Identity 
In coding theory, the weight enumerator polynomial of a binary linear code specifies the number of words of each possible Hamming weight. Let be a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Problem statement: The government has admitted the effectiveness of ICT in bringing changes to the socio-economic aspects of the… 
2010
2010
For a Type $T \in${I, II, III, IV} of codes over finite fields and length $N$ where there exists no self-dual Type $T$ code of… 
2008
2008
With the invention of turbo codes in 1993 came increased interest in codes and iterative decoding schemes. Gallager's Regular… 
Review
2007
Review
2007
Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured encoders and… 
2005
2005
We construct a family of linear binary block codes that are useful for Bluetooth, OFDM and BLAST applications. These codes are… 
2002
2002
An average Hamming weight enumerator is derived for the codewords at each Hamming distance from a received pattern in the set of… 
1990
1990
An efficient lattice vector quantization design and the associated fast coding algorithm are proposed for high-bit-rate, high… 
1986
1986
. The theory of weight distributions of irreducible cyclic codes over a finite field has been extensively developed by R. J… 
1972
1972
This paper presents a number of interesting results relating to the determination of actual minimum distance of cyclic codes… 
1970
1970
M. R. Schroeder recently proposed a scheme for compression of motion picture data by taking the difference of two successive…