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)

Related topics

Related topics

7 relations
Coding theoryDual codeHamming weightLinear code

Broader (1)

Error detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Diversely enumerating system-level architectures
Embedded systems are highly constrained, and modern constraint solvers can be used to synthesize architectures satisfying… 
Review
2011
Review
2011
Reddening and metallicity maps of the Milky Way bulge from VVV and 2MASS. I. The method and minor axis maps
We present a method to obtain reddening maps and to trace structure and metallicity gradients of the bulge using data from the… 
2011
2011
DYNAMICAL FRICTION IN CUSPY GALAXIES
In this paper, we treat the problem of the dynamical friction decay of a massive object moving in an elliptical galaxy with a… 
2009
2009
On asymptotic ensemble weight enumerators of LDPC-like codes
For LDPC-like codes such as LDPC, GLDPC, and DGLDPC codes, it is well known that the error floor can be caused by the codewords… 
Review
2007
Review
2007
Ensemble Trapping Set Enumerators for Protograph-Based LDPC Codes
Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured encoders and… 
2002
2002
More results on the weight enumerator of product codes
We consider the product code C/sub p/ of q-ary linear codes with minimum distances d/sub c/ and d/sub r/. The words in C/sub p… 
Review
1999
Review
1999
Linear Codes and Polylinear Recurrences over Finite Rings and Modules
We give a short survey of the results obtained in the last several decades that develop the theory of linear codes and polylinear… 
1996
1996
On the weight distribution of linear block codes formed from convolutional codes
We explain how to obtain the weight enumerator and the performance of linear block codes formed in several distinct ways from a… 
Highly Cited
1988
Highly Cited
1988
On Completely Regular Propelinear Codes
In a previous paper (see [7]) we found that given a distance regular e-latticed graph γ we can associate with it a completely… 
1970
1970
Some mathematical properties of a scheme for reducing the bandwidth of motion pictures by hadamard smearing
M. R. Schroeder recently proposed a scheme for compression of motion picture data by taking the difference of two successive… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)