Modular sequences and modular Hadamard matrices | Zendy

Eliahou Shalom | Zendy; Kervaire Michel | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Modular sequences and modular Hadamard matrices

Author(s) -

Eliahou Shalom,

Kervaire Michel

Publication year - 2001

Publication title -

journal of combinatorial designs

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.618

H-Index - 34

eISSN - 1520-6610

pISSN - 1063-8539

DOI - 10.1002/jcd.1007

Subject(s) - mathematics , hadamard transform , conjecture , modular design , binary golay code , combinatorics , hadamard matrix , modular form , construct (python library) , set (abstract data type) , matrix (chemical analysis) , square (algebra) , discrete mathematics , statistics , pure mathematics , computer science , geometry , mathematical analysis , materials science , composite material , programming language , operating system

For every n divisible by 4, we construct a square matrix H of size n , with coefficients ± 1, such that H · H t ≡ nI mod 32. This solves the 32‐modular version of the classical Hadamard conjecture. We also determine the set of lengths of 16‐modular Golay sequences. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 187–214, 2001

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research