Two algorithms for the direct computation of binary correlation functions

Two algorithms for computing the two-sided correlation function (correlogram) and several identities for the cross correlation of binary codes are developed. The basic theorem (The Product Rule) shows the correlogram of two binary codes, X * Y, to be the arithmetic product of Y and the mirror reversal of X, when the code symbols are ±1.