Enumerator polynomial

Known as: McWilliam's Identity, Outer distribution, Weight enumerator 
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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1970-2017
0204019702017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
In this paper we introduce digital nets over finite abelian groups which contain digital nets over finite fields and certain… (More)
  • table 3.1
Is this relevant?
2011
2011
Cyclic codes with two zeros and their dual codes have been a subject of study for many years. However, their weight distributions… (More)
  • table I
Is this relevant?
2011
2011
Protograph-based LDPC and generalized LDPC (G-LDPC) codes have the advantages of a simple design procedure and highly structured… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
It is proved that the set of higher weight enumerators of a linear code over a finite field is equivalent to the Tutte polynomial… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In this paper we discuss AWGN coding theorems for ensembles of coding systems which are built from fixed convolutional codes… (More)
  • figure 2
  • table 1
  • figure 4
  • figure 5
Is this relevant?
2005
2005
A closed form formula of the partition weight enumerator of maximum distance separable (MDS) codes is derived for an arbitrary… (More)
  • figure 1
  • figure 2
Is this relevant?
2002
2002
With every linear code is associated a permutation group whose cycle index is the weight enumerator of the code (up to a trivial… (More)
Is this relevant?
Highly Cited
1975
Highly Cited
1975
A complete classification is given of all [22, 111 and [24, 121 binary self-dual codes. For each code we give the order of its… (More)
  • table I
  • table II
  • table III
Is this relevant?
1972
1972
Gleason has recently shown that the weight enumerators of binary and ternary self-dual codes are polynomials in two given… (More)
Is this relevant?
Highly Cited
1971
Highly Cited
1971
Recently, a theorem was proved by Berlekamp (1970) which asserts that all sufficiently low weight codewords in certain supercodes… (More)
Is this relevant?