On difference matrices, resolvable transversal designs and generalized Hadamard matrices

1979 ◽  
Vol 167 (1) ◽  
pp. 49-60 ◽  
Author(s):  
Dieter Jungnickel
Keyword(s):  
Hadamard Matrices ◽  
Difference Matrices ◽  
Transversal Designs

scholarly journals Classification of Generalized Hadamard Matrices $H(6,3)$ and Quaternary Hermitian Self-Dual Codes of Length 18

10.37236/443 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Masaaki Harada ◽  
Clement Lam ◽  
Akihiro Munemasa ◽  
Vladimir D. Tonchev
Keyword(s):  
Hadamard Matrices ◽  
Dual Codes ◽  
Transversal Designs

All generalized Hadamard matrices of order 18 over a group of order 3, $H(6,3)$, are enumerated in two different ways: once, as class regular symmetric $(6,3)$-nets, or symmetric transversal designs on 54 points and 54 blocks with a group of order 3 acting semi-regularly on points and blocks, and secondly, as collections of full weight vectors in quaternary Hermitian self-dual codes of length 18. The second enumeration is based on the classification of Hermitian self-dual $[18,9]$ codes over $GF(4)$, completed in this paper. It is shown that up to monomial equivalence, there are 85 generalized Hadamard matrices $H(6,3)$, and 245 inequivalent Hermitian self-dual codes of length 18 over $GF(4)$.

Partial λ-Geometries and Generalized Hadamard Matrices Over Groups

1979 ◽  
Vol 31 (3) ◽  
pp. 617-627 ◽  
Author(s):  
David A. Drake
Keyword(s):  
Existence Theorem ◽  
Hadamard Matrices ◽  
Natural Generalization ◽  
Latin Squares ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Transversal Designs ◽  
Complete Mappings

Section 1 of this paper contains all the work which deals exclusively with generalizations of Hadamard matrices. The non-existence theorem proven here (Theorem 1.10) generalizes a theorem of Hall and Paige [15] on the non-existence of complete mappings in certain groups.In Sections 2 and 3, we consider the duals of (Hanani) transversal designs; these dual structures, which we call (s, r, µ)-nets, are a natural generalization of the much studied (Bruck) nets which in turn are equivalent to sets of mutually orthogonal Latin squares. An (s, r, µ)-net is a set of s2µ points together with r parallel classes of blocks. Each class consists of s blocks of equal cardinality. Two non-parallel blocks meet in precisely µ points. It has been proven that r is always less than or equal to (s2µ – l) / (s – 1).

Some Infinite Series of 2-Weighing and 3-Weighing Matrices from Hadamard Matrices

2018 ◽  
Vol 9 (12) ◽  
pp. 2165-2168
Author(s):  
Gopal Prajapati ◽  
Mithilesh Kumar Singh
Keyword(s):  
Infinite Series ◽  
Hadamard Matrices ◽  
Weighing Matrices

Circles on lattices and Hadamard matrices

2019 ◽  
pp. 2-9 ◽  
Author(s):  
N. A. Balonin ◽  
M. B. Sergeev ◽  
J. Seberry ◽  
O. I. Sinitsyna
Keyword(s):  
Hadamard Matrices ◽  
Lattice Points ◽  
Practical Significance ◽  
Upper And Lower Bounds ◽  
Problem Size ◽  
Orthogonal Matrices ◽  
Video Information ◽  
Scientific Schools ◽  
Gauss Theorem ◽  
Triangular Numbers

Introduction: The Hadamard conjecture about the existence of Hadamard matrices in all orders multiple of 4, and the Gauss problem about the number of points in a circle are among the most important turning points in the development of mathematics. They both stimulated the development of scientific schools around the world with an immense amount of works. There are substantiations that these scientific problems are deeply connected. The number of Gaussian points (Z3 lattice points) on a spheroid, cone, paraboloid or parabola, along with their location, determines the number and types of Hadamard matrices.Purpose: Specification of the upper and lower bounds for the number of Gaussian points (with odd coordinates) on a spheroid depending on the problem size, in order to specify the Gauss theorem (about the solvability of quadratic problems in triangular numbers by projections onto the Liouville plane) with estimates for the case of Hadamard matrices. Methods: The authors, in addition to their previous ideas about proving the Hadamard conjecture on the base of a one-to-one correspondence between orthogonal matrices and Gaussian points, propose one more way, using the properties of generalized circles on Z3 .Results: It is proved that for a spheroid, the lower bound of all Gaussian points with odd coordinates is equal to the equator radius R, the upper limit of the points located above the equator is equal to the length of this equator L=2πR, and the total number of points is limited to 2L. Due to the spheroid symmetry in the sector with positive coordinates (octant), this gives the values of R/8 and L/4. Thus, the number of Gaussian points with odd coordinates does not exceed the border perimeter and is no less than the relative share of the sector in the total volume of the figure.Practical significance: Hadamard matrices associated with lattice points have a direct practical significance for noise-resistant coding, compression and masking of video information.

scholarly journals Hadamard Matrices with Cocyclic Core

Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 857
Author(s):  
Víctor Álvarez ◽  
José Andrés Armario ◽  
María Dolores Frau ◽  
Félix Gudiel ◽  
María Belén Güemes ◽  
...  
Keyword(s):  
Hadamard Matrices ◽  
Combinatorial Designs ◽  
Powerful Technique ◽  
Uniform Approach ◽  
Structured Approach

Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s, it has revealed itself as a powerful technique for looking for (cocyclic) Hadamard matrices. Ten years later, the series of papers by Kotsireas, Koukouvinos and Seberry about Hadamard matrices with one or two circulant cores introduced a different structured approach to the Hadamard conjecture. This paper is built on both strengths, so that Hadamard matrices with cocyclic cores are introduced and studied. They are proved to strictly include usual Hadamard matrices with one and two circulant cores, and therefore provide a wiser uniform approach to a structured Hadamard conjecture.

scholarly journals Automorphism groups of Hadamard matrices

1969 ◽  
Vol 6 (3) ◽  
pp. 279-281 ◽  
Author(s):  
William M. Kantor
Keyword(s):  
Automorphism Groups ◽  
Hadamard Matrices
Sign in / Sign up

Export Citation Format

Share Document