Searcharxiv⌕ Search

arXiv subjects

Masaaki Harada

Publications and source records attributed to Masaaki Harada.

At least 19 recordsLinked to original sources

Nonexistence of a quasi-symmetric $2$-$(33,15,35)$ design

It is shown that there exists no quasi-symmetric $2$-$(33,15,35)$ design with intersection numbers $6$ and $9$. This is proved by considering the ternary code generated by the incidence vectors of the blocks and its dual code.

math.CO↗

On $t$-designs supported by self-orthogonal codes

We study self-orthogonal $t$-$(v,k,λ)$ designs satisfying the condition that the codes generated by the designs are self-orthogonal codes whose codewords of minimum weight $k$ correspond to the blocks. A classification of such designs is given under the conditions that $t\geq \lfloor k/4\rfloor+1\geq2$ and $t \le 11$. This yields a classification of self-orthogonal codes of minimum weight $k$ whose codewords of minimum weight form a $t$-design under the same conditions.

math.CO↗

Double Toeplitz codes and their average weight enumerators

Recently, double Toeplitz codes have been introduced as a generalization of double circulant codes. In this paper, we study the average weight enumerators of double Toeplitz codes. As an application, we consider the existence of double Toeplitz codes over $\mathbb{F}_q$ with some specified minimum weights for $q \in \{2,3,4\}$. We also give a classification of double Toeplitz codes over $\mathbb{F}_q$ with the largest minimum weights for moderate lengths and $q \in \{2,3,4\}$.

math.CO↗

Unbiased weighing matrices of weight $9$

We investigate unbiased weighing matrices of weight $9$ and provide a construction method using mutually suitable Latin squares. For $n \le 16$, we determine the maximum size among sets of mutually unbiased weighing matrices of order $n$ and weight $9$. Notably, our findings reveal that $13$ is the smallest order where such pairs exist, and $16$ is the first order for which a maximum class of unbiased weighing matrices is found.

math.CO↗

On the classification of skew Hadamard matrices of order 36 and related structures

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 ternary self-dual codes and association schemes constructed from the skew Hadamard matrices of order $36$.

math.CO↗

A method for constructing quaternary Hermitian self-dual codes and an application to quantum codes

We introduce quaternary modified four $μ$-circulant codes as a modification of four circulant codes. We give basic properties of quaternary modified four $μ$-circulant Hermitian self-dual codes. We also construct quaternary modified four $μ$-circulant Hermitian self-dual codes having large minimum weights. Two quaternary Hermitian self-dual $[56,28,16]$ codes are constructed for the first time. These codes improve the previously known lower bound on the largest minimum weight among all quaternary (linear) $[56,28]$ codes. In addition, these codes imply the existence of a quantum $[[56,0,16]]$ code.

cs.IT↗

Hadamard matrices of orders 60 and 64 with automorphisms of orders 29 and 31

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$ are computed, as well as the binary doubly even self-dual codes of length $120$ with generator matrices defined by related Hadamard designs. Several new ternary near-extremal self-dual codes, as well as binary near-extremal doubly even self-dual codes with previously unknown weight enumerators are found.

math.CO↗

Ternary extremal four-negacirculant self-dual codes

In this note, we give basic properties of ternary four-negacirculant self-dual codes. By exhaustive computer search based on the properties, we complete a classification of ternary extremal four-negacirculant self-dual codes of lengths 40, 44, 48, 52 and 60.

math.CO↗

Some restrictions on the weight enumerators of near-extremal ternary self-dual codes and quaternary Hermitian self-dual codes

We give restrictions on the weight enumerators of ternary near-extremal self-dual codes of length divisible by $12$ and quaternary near-extremal Hermitian self-dual codes of length divisible by $6$. We consider the weight enumerators for which there is a ternary near-extremal self-dual code of length $12m$ for $m =3,4,5,6$. Also we consider the weight enumerators for which there is a quaternary near-extremal Hermitian self-dual code of length $6m$ for $m =4,5,6$.

cs.IT↗

Self-dual codes over $\mathbb{F}_5$ and $s$-extremal unimodular lattices

New $s$-extremal extremal unimodular lattices in dimensions $38$, $40$, $42$ and $44$ are constructed from self-dual codes over $\mathbb{F}_5$ by Construction A. In the process of constructing these codes, we obtain a self-dual $[44,22,14]$ code over $\mathbb{F}_5$. In addition, the code implies a $[43,22,13]$ code over $\mathbb{F}_5$. These codes have larger minimum weights than the previously known $[44,22]$ codes and $[43,22]$ codes, respectively.

cs.IT↗

Construction of extremal Type II $\mathbb{Z}_{2k}$-codes

We give methods for constructing many self-dual $\mathbb{Z}_m$-codes and Type II $\mathbb{Z}_{2k}$-codes of length $2n$ starting from a given self-dual $\mathbb{Z}_m$-code and Type II $\mathbb{Z}_{2k}$-code of length $2n$, respectively. As an application, we construct extremal Type II $\mathbb{Z}_{2k}$-codes of length $24$ for $k=4,5,\ldots,20$ and extremal Type II $\mathbb{Z}_{2k}$-codes of length $32$ for $k=4,5,\ldots,10$. We also construct new extremal Type II $\mathbb{Z}_4$-codes of lengths $56$ and $64$.

cs.IT↗

Hadamard matrices related to a certain series of ternary self-dual codes

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 self-dual code contains codewords which form a Hadamard matrix of order $2(p+1)$ when $p$ is congruent to $5$ modulo $24$. In addition, it is shown that the ternary self-dual code is generated by the rows of the Hadamard matrix. We also demonstrate that the third ternary extremal self-dual code of length $60$ contains at least two inequivalent Hadamard matrices.

math.CO↗

Construction of binary LCD codes, ternary LCD codes and quaternary Hermitian LCD codes

We give two methods for constructing many linear complementary dual (LCD for short) codes from a given LCD code, by modifying some known methods for constructing self-dual codes. Using the methods, we construct binary LCD codes and quaternary Hermitian LCD codes, which improve the previously known lower bound on the largest minimum weights.

cs.IT↗