Improving the lower bounds on inequivalent Hadamard matrices through orthogonal designs and meta-programming techniques

DOI10.1016/j.apnum.2009.06.002zbMath1219.05028OpenAlexW2082828794MaRDI QIDQ972300

Dimitris E. Simos, Christos Koukouvinos

Publication date: 25 May 2010

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2009.06.002

zbMATH Keywords

sequencesHadamard matricesorthogonal designsmeta-programmingnon-periodic autocorrelation function

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Orthogonal arrays, Latin squares, Room squares (05B15) Boolean and Hadamard matrices (15B34)

Uses Software

• Magma

Cites Work

• New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function---a review
• Hadamard equivalence via graph isomorphism
• Hadamard ideals and Hadamard matrices with two circulant cores
• Inequivalent Hadamard matrices with buckets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improving the lower bounds on inequivalent Hadamard matrices through orthogonal designs and meta-programming techniques