Weight Distributions of Some Classes of Binary Cyclic Codes

Carlos R.P. Hartmann, Syracuse University
J. R. Riek Jr., Syracuse University



Let h1(x)h2(x) be the parity check polynomial of a binary cyclic code. This article presents a formula for decomposing words in the code as sums of multiples of words in the codes whose parity check polynomials are h1(x) and h2(x). This decomposition provides information about the weight distribution of the code.