Paper Info
Title
Weight enumerators of codes derived from polynomial product algorithms
Abstract
Let Z ( u ), Y ( u ) be polynomials with respective degrees k , d and coefficients { z sub i}, {y sub j}. Then each coefficient in the product Y ( u ) Z ( u ) is a sum of certain bilinear terms ( z sub i)(y sub j). If there exist n bilinear forms to span these sums, there is a linear error-correcting code of length n , dimension k and minimum distance d . Such codes can be nested so as to provide a natural system for adapting to the intensity of interference. We determine the weight enumerators for a class of these codes.
Year
DOI
Venue
1997
10.1016/S0012-365X(96)00241-5
Discrete Mathematics
Keywords
Field
DocType
weight enumerators,polynomial product algorithm,bilinear form,error correction code
Discrete mathematics,Combinatorics,Bilinear form,Polynomial,Interference (wave propagation),Mathematics,Bilinear interpolation
Journal
Volume
ISSN
Citations 
167-168,
Discrete Mathematics
0
PageRank 
References 
Authors
0.34
3
1
Name
Order
Citations
PageRank
Stuart G. Hoggar1262.87