IEEE Transactions on Information Theory · 1991 · 43 citations · 7 references
Explicit Weight-enumeratorCombinatorics On WordEngineeringGeneralized Reed-solomon CodesAlgebraic MethodComputational ComplexityComputer ScienceAverage Binary Weight-enumeratorDiscrete MathematicsBinary ExpansionsCoding TheoryBinary CodesError Correction CodeVariable-length CodeAlgebraic Coding Theory
An explicit weight-enumerator for the set of binary expansions of a class of generalized Reed-Solomon codes is derived. This enumerator is then used to show that most of these binary codes are asymptotically good, and to bound the rates of self-intersecting codes.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
7
Gérard Cohen, A. Lempel · Discrete Mathematics · 1985 · 55 citations
Mathematical Programming, Engineering, Linear Intersecting Codes +4
Tadao Kasami, Shu Lin · Linear Algebra and its Applications · 1988 · 41 citations
Generator Polynomial, Binary Weight Distribution, Reed-solomon Code +3