Let

be the parity-check polynomial of a binary cyclic code. This correspondence presents a formula for decomposing words in the code as sums of multiples of words in the codes whose parity-check polynomials are

and

. This decomposition provides information about the weight distribution of the code.