A new approach to the excess problem of Hadamard matrices

DOI10.5802/alco.33zbMath1401.05054OpenAlexW2902039535WikidataQ128895532 ScholiaQ128895532MaRDI QIDQ1627826

Mitsugu Hirasaka, Sho Suda, Koji Momihara

Publication date: 3 December 2018

Published in: Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5802/alco.33

zbMATH Keywords

association schemeHadamard matrixblock designexcessregular Hadamard matrix\(t\)-intersection setbiregular Hadamard matrix

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Other character sums and Gauss sums (11T24) Cyclotomy (11T22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction of some Hadamard matrices with maximum excess
• An infinite class of Hadamard matrices of maximal excess
• The excess of Hadamard matrices and optimal designs
• On the excess of Hadamard matrices
• Supplementary difference sets and optimal designs
• Subschemes of some association schemes
• Hadamard matrices of order \(\equiv{} 8\)(mod 16) with maximal excess
• Cyclotomy and strongly regular graphs
• The excess problem and some excess inequivalent matrices of order 32
• The evaluation of Gauss sums for characters of 2-power order
• Weaving hadamard matrices with maximum excess and classes with small excess
• Conference matrices with maximum excess and two-intersection sets

This page was built for publication: A new approach to the excess problem of Hadamard matrices