ate sequence from which the output sequence is derived. The design of DeBruijn sequences, i.e., sequences of period 2m generated by m-stage binary registers with nonlinear feedback, are surveyed in [69]. 5.10 REFERENCES [1] W.V. Quine, "The problem of simplifying truth functions," Am. Math. Monthly, vol. 59, no. 8, pp. 521-531, October 1952. [2] E. J. McCluskey, "Minimization of Boolean functions," Bell Syst. Tech. J., vol. 35, no. 5, pp. 1417-1444, November 1956. [3] F. J. Hill and G. R. Peterson, Introduction to Switching Theory and Logical Design, New York: John Wiley, 1968. [4] I.S. Reed, "A class of multiple error-corecting codes and the decoding scheme," IRE Trans. Inform. Theory, vol. 4, pp. 38-49, 1954. [5] D. E. Muller, "Application of Boolean algebra to switching circuit design and to error correction," IRE Trans. Electron. Comput., vol. 3, pp. 6-12, 1954. [6] W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes, 2nd ed., Cambridge, MA: M.I.T. Press, 1972. [7] E. R. Berlekamp, Algebraic Coding Theory, New York: McGraw-Hill, 1968. [8] J.L. Massey, "Shift register synthesis and BCH decoding," IEEE Trans. Inform. Theory, IT-15, pp. 122-127, January 1969. [9] W.H. Mills, "Continued fractions and linear recurrences," Math. Comput., vol. 29, pp. 173-180, January 1975. [10] R. A. Scholtz and L. R. Welch, "Continued fractions and Berlekamp's Algorithm," IEEE Trans. Inform. Theory, IT-25, No. 1, pp. 19-27, January 1979. [11] A Lempel and H. Greenberger, "Families of sequences with optimal Hamming correlation properties," IEEE Trans. Inform. Theory, IT-15, pp. 90-94, January 1974. [12] S. W. Golomb, Shift Register Sequences, San Francisco, CA: Holden-Day, 1967; revised edition, Aegean Park Press, Laguna Hills, CA, 1982. [13] T. C. Bartee and P. W. Wood, "Coding for Tracking Radar Ranging," M.I.T. Lincoln Lab, Lexington, MA, Tech. Rept. 318, 1963. [14] J. H. Lindholm, "An analysis of the pseudo-randomness properties of subse- quences of long m-sequences," IEEE Trans. Inform. Theory, IT-14, pp. 569-576, Jul