Ensemble correlation function computation by multiplication

M. Bernfeld (ibid., vol 52, p. 744, June 1964) has observed that binary sequences have an autocorrelation function which may be obtained by ordinary decimal multiplication of the sequence by its inverse, providing that the columns do not sum to over ten (yielding carries). The present author extends this observation in two directions. The lint extension notes that one can retrieve carries by making use of the symmetry properties of the autocorrelation function, and thus accommodate sequences or codes with a dynamic range of one through nine. The second extension observes that there are alternate means of decomposing a binary sequence of pluses and minuses which yield an easier machine computation than Bernfeld´s.