On one construction method for Hadamard matrices
The authors of this paper present a new and general construction of binary Hadamard matrices. The construction involves first using a generalised concatenation method to construct \(\mathbb{Z}_p\)-codes with the Lee metric, and then to apply certain mappings to \(\mathbb{Z}_2\) that include the Gray map when \(p=4\). For the latter case, this construction allows codes over \(\mathbb{Z}_4\) of any arbitrary length \(n\) for which a Hadamard matrix of order \(n\) exists, with minimum Lee distance equal to \(n\) which, after the application of the Gray map, gives a binary Hadamard code of length \(2n\). The authors demonstrate this construction by constructing Hadamard codes of lengths \(n=16,32,48,64\) with almost all possible ranks and nullities, giving new lower bounds on the number of such codes up to isomorphism. It turns out that the authors' construction coincides in a special case with the Sylvester (or Kronecker) construction and can be regarded as a version of the modified Sylvester construction by No and Song; see [\textit{J.-S. No} and \textit{H.-Y. Song}, ``Generalized Sylvester-type Hadamard matrices, Proc. 2000 IEEE Int. Symp. on Information Theory (ISIT'2000), Sorrento, Italy, June 25--30. 472 (2000; \url{doi:10.1109/ISIT.2000.866770})]. The authors generalise this modified Sylvester construction by using two families of Hadamard matrices, each respectively containing \(k\) matrices of order \(m\) and \(m\) matrices of order \(k\).
- scientific article; zbMATH DE number 850410
- A construction for Hadamard matrices
- A construction of Hadamard matrices
- scientific article; zbMATH DE number 874211
- scientific article; zbMATH DE number 1094178
- Construction of some new Hadamard matrices
- On a construction of regular Hadamard matrices
- New constructions of Hadamard matrices
- Hadamard matrices. Constructions using number theory and linear algebra
- On Hadamard matrices
- Algebraic techniques for nonlinear codes
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Classification of Hadamard matrices of order 28
- Classification of the <inline-formula> <tex-math notation="LaTeX">$Z_{2}Z_{4}$ </tex-math></inline-formula>-Linear Hadamard Codes and Their Automorphism Groups
- Codes over \(\mathbb{Z}_{2^k}\), Gray map and self-dual codes
- Equivalences among \(\mathbb{Z}_{2^s} \)-linear Hadamard codes
- Every Z2k-Code is a Binary Propelinear Code
- Hadamard matrices of order 32
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 3555872 (Why is no real title available?)
- New Hadamard matrix of order 24
- On $Z_{2^k}$-Dual Binary Codes
- On \(\mathbb {Z}_{2^s}\)-linear Hadamard codes: kernel and partial classification
- On \(\mathbb{Z}_8\)-linear Hadamard codes: rank and classification
- On the classification of Hadamard matrices of order 32
- On the generalized concatenated construction for codes in \(L_1\) and Lee metrics
- Rank and Kernel of Binary Hadamard Codes
- Spherical codes generated by binary partitions of symmetric pointsets
- Structure of Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+2\) over \(\mathbb F_2\)
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Z/sub 2/k-linear codes
This page was built for publication: On one construction method for Hadamard matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173469)
