Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Hadamard Designs

Edward Spence
Proceedings of the American Mathematical Society
Vol. 32, No. 1 (Mar., 1972), pp. 29-31
DOI: 10.2307/2038298
Stable URL: http://www.jstor.org/stable/2038298
Page Count: 3
  • Read Online (Free)
  • Download ($30.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Hadamard Designs
Preview not available

Abstract

It has already been shown, using a combinatorial argument, that a Hadamard design with each letter repeated once and only once can exist for 2, 4 and 8 letters only. In this paper the same result is proved by a different method which utilizes the underlying algebraic structure of such a Hadamard design.

Page Thumbnails

  • Thumbnail: Page 
29
    29
  • Thumbnail: Page 
30
    30
  • Thumbnail: Page 
31
    31