Andrew Odlyzko: Papers on Sequences and Polynomials with Restricted Coefficients

• Search for ultraflat polynomials with plus and minus one coefficients, A. Odlyzko, pp. 39-55 in Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham, S. Butler, J. Cooper, and G. Hurlbert, eds., Cambridge Univ. Press, 2018. [preprint, PDF]

• Construction of invertible sequences for multipath estimation, A. M. Odlyzko, pp. 323-331 in Communications and Cryptography: Two sides of One Tapestry, R. E. Blahut, D. J. Costello, Jr., U. Maurer, and T. Mittelholzer (eds.), Kluwer, (1994). [PDF]

• Zeros of polynomials with 0,1 coefficients, A. M. Odlyzko and B. Poonen, L'Enseign. Math., 39 (1993), pp. 317-348. [online journal version] [PDF]

• Minima of cosine sums and maxima of polynomials on the unit circle, A. M. Odlyzko, J. London Math. Soc. (2), 26 (1982), pp. 412-420.

• On an irreducibility theorem of A. Cohn, J. Brillhart, M. Filaseta, and A. M. Odlyzko, Canad. J. Math., 33 (1981), pp. 1055-1059.

• Coefficient inaccuracy in FIR filters, A. Gersho, B. Gopinath, and A. Odlyzko, pp. 375-377 in Proc. IEEE Int. Symp. Acoustics, Speech, Signal Processing, Washington D.C., April 1979.

• Coefficient inaccuracy in transversal filtering, A. Gersho, B. Gopinath, and A. M. Odlyzko, Bell System Tech. J., 58 (1979), pp. 2301-2316. [online journal version]