English
Related papers

Related papers: The codes and the lattices of Hadamard matrices

200 papers

In 2013, Nebe and Villar gave a series of ternary self-dual codes of length $2(p+1)$ for a prime $p$ congruent to $5$ modulo $8$. As a consequence, the third ternary extremal self-dual code of length $60$ was found. We show that the ternary…

Combinatorics · Mathematics 2023-03-28 Makoto Araya , Masaaki Harada , Koji Momihara

A classification of Hadamard matrices of order $2p+2$ with an automorphism of order $p$ is given for $p=29$ and $31$. The ternary self-dual codes spanned by the newly found Hadamard matrices of order $60$ with an automorphism of order $29$…

Combinatorics · Mathematics 2023-07-19 Makoto Araya , Masaaki Harada , Vladimir D. Tonchev

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…

Combinatorics · Mathematics 2012-05-28 Masaaki Harada , Clement Lam , Akihiro Munemasa , Vladimir D. Tonchev

In this note, we study the existence of Hadamard matrices of order $36$ formed by codewords of weight $36$ in some ternary near-extremal self-dual codes of length $36$.

Combinatorics · Mathematics 2023-03-10 Masaaki Harada , Keita Ishizuka

The $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-additive codes are subgroups of $\mathbb{Z}_2^{\alpha_1} \times \mathbb{Z}_4^{\alpha_2} \times \mathbb{Z}_8^{\alpha_3}$. A $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard code is a Hadamard…

Information Theory · Computer Science 2024-01-29 Dipak K. Bhunia , Cristina Fernández-Córdoba , Mercè Villanueva

Ternary self-dual codes have been classified for lengths up to 20. At length 24, a classification of only extremal self-dual codes is known. In this paper, we give a complete classification of ternary self-dual codes of length 24 using the…

Combinatorics · Mathematics 2012-05-28 Masaaki Harada , Akihiro Munemasa

In the present paper, we give Assmus--Mattson type theorems for codes and lattices. We show that a binary doubly even self-dual code of length 24m with minimum weight 4m provides a combinatorial 1-design and an even unimodular lattice of…

Combinatorics · Mathematics 2020-12-22 Tsuyoshi Miezaki , Akihiro Munemasa , Hiroyuki Nakasora

In this paper, binary extremal singly even self-dual codes of length 40 and extremal odd unimodular lattices in dimension 40 are studied. We give a classification of extremal singly even self-dual codes of length 40. We also give a…

Combinatorics · Mathematics 2013-02-19 Stefka Bouyuklieva , Iliya Bouyukliev , Masaaki Harada

The $\mathbb{Z}_{2^s}$-additive codes are subgroups of $\mathbb{Z}^n_{2^s}$, and can be seen as a generalization of linear codes over $\mathbb{Z}_2$ and $\mathbb{Z}_4$. A $\mathbb{Z}_{2^s}$-linear Hadamard code is a binary Hadamard code…

Information Theory · Computer Science 2018-01-17 Cristina Fernández-Córdoba , Carlos Vela , Mercè Villanueva

Two skew Hadamard matrices are considered {\sf SH}-equivalent if they are similar by a signed permutation matrix. This paper determines the number of {\sf SH}-inequivalent skew Hadamard matrices of order $36$ for some types. We also study…

Combinatorics · Mathematics 2024-02-20 Makoto Araya , Masaaki Harada , Hadi Kharaghani , Ali Mohammadian , Behruz Tayfeh-Rezaie

For some important families of complete infinite lattices, we study some generalizations of two fundamental notions which are mostly treated for finite lattices. Specifically, for well-separated $\kappa$-lattices, and also for weakly atomic…

Rings and Algebras · Mathematics 2026-04-24 Sota Asai , Osamu Iyama , Kaveh Mousavand , Charles Paquette

The rigidity of a matrix describes the minimal number of entries one has to change to reduce matrix's rank to r. We give very simple combinatorial proof of the lower bound for the rigidity of Sylvester (special case of Hadamard) matrix that…

Computational Complexity · Computer Science 2007-05-23 Gatis Midrijanis

In this paper we classify all extremal and $s$-extremal binary self-dual codes of length 38. There are exactly 2744 extremal $[38,19,8]$ self-dual codes, two $s$-extremal $[38,19,6]$ codes, and 1730 $s$-extremal $[38,19,8]$ codes. We obtain…

Discrete Mathematics · Computer Science 2011-11-02 Carlos Aguilar-Melchor , Philippe Gaborit , Jon-Lark Kim , Lin Sok , Patrick Solé

A $Z_2Z_4$-linear Hadamard code of length $\alpha+2\beta=2^t$ is a binary Hadamard code which is the Gray map image of a $Z_2Z_4$-additive code with $\alpha$ binary coordinates and $\beta$ quaternary coordinates. It is known that there are…

Information Theory · Computer Science 2019-01-10 Denis Krotov , Mercè Villanueva

A complete classification of quaternary complex Hadamard matrices of orders 10, 12 and 14 is given, and a new parametrization scheme for obtaining new examples of affine parametric families of complex Hadamard matrices is provided. On the…

Combinatorics · Mathematics 2012-04-24 Pekka H. J. Lampio , Ferenc Szöllősi , Patric R. J. Östergård

This paper is concerned with quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices, which are generalizations of unbiased Hadamard matrices, equivalently unbiased bases. These matrices are studied from the viewpoint of…

Combinatorics · Mathematics 2015-10-01 Makoto Araya , Masaaki Harada , Sho Suda

It is proved that a code $L(q)$ which is monomially equivalent to the Pless symmetry code $C(q)$ of length $2q+2$ contains the (0,1)-incidence matrix of a Hadamard 3-$(2q+2,q+1,(q-1)/2)$ design $D(q)$ associated with a Paley-Hadamard matrix…

Combinatorics · Mathematics 2021-09-14 Vladimir D. Tonchev

We establish several independent results concerning extremal, left modular, congruence uniform, and semidistributive lattices. An equivalent characterization of left modular lattices is obtained in terms of edge-labellings, together with…

Combinatorics · Mathematics 2025-12-01 Adrien Segovia

Complex Hadamard matrices H of order 6 are characterized in a novel manner, according to the presence/absence of order 2 Hadamard submatrices. It is shown that if there exists one such submatrix, H is equivalent to a Hadamard matrix where…

Mathematical Physics · Physics 2013-06-12 Bengt R. Karlsson

We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…

Information Theory · Computer Science 2023-12-25 Peter Beelen , Trygve Johnsen , Prasant Singh
‹ Prev 1 2 3 10 Next ›