相关论文: Z4-linear Hadamard and extended perfect codes

The projective special linear group $\PSL_2(n)$ is $2$-transitive for all primes $n$ and $3$-homogeneous for $n \equiv 3 \pmod{4}$ on the set $\{0,1, \cdots, n-1, \infty\}$. It is known that the extended odd-like quadratic residue codes are…

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary…

Self-dual codes over $\Z_2\times\Z_4$ are subgroups of $\Z_2^\alpha \times\Z_4^\beta$ that are equal to their orthogonal under an inner-product that relates to the binary Hamming scheme. Three types of self-dual codes are defined. For each…

In this paper, we determine the dimensions of the residue codes of extremal Type II Z4-codes for lengths 32 and 40. We demonstrate that every binary doubly even self-dual code of length 32 can be realized as the residue code of some…

We show that an $n\times n$ circulant Hadamard matrix must satisfy a family of congruence equations that have solutions only when $n \leq 4$, proving Ryser's 1963 conjecture that no such matrices exist for $n>4$.

A conjecture of N. Terai states that for any integer $k>1$, the equation $x^2+(2k-1)^y =k^z$ has only one solution, namely, $(x, y, z) = (k-1, 1, 2).$ Using the structure of class groups of binary quadratic forms, we prove the conjecture…

For some extremal (optimal) odd unimodular lattices L in dimensions n=12,16,20,32,36,40 and 44, we determine all positive integers k such that L contains a k-frame. This result yields the existence of an extremal Type I Zk-code of lengths…

This work deals with Hadamard Z2Z4Q8-codes, which are binary codes after a Gray map from a subgroup of the direct product of Z2, Z4 and Q8 groups, where Q8 is the quaternionic group. In a previous work, these kind of codes were classified…

Two submatrices $A,D$ of a Hadamard matrix $H$ are called complementary if, up to a permutation of rows and columns, $H=[^A_C{\ }^B_D]$. We find here an explicit formula for the polar decomposition of $D$. As an application, we show that…

We propose an innovative approach to investigating the linearity of $\mathbb{Z}_{2^L}$-linear codes derived from $\mathbb{Z}_{2^L}$-additive codes using the generalized Gray map. To achieve this, we define two related binary codes: the…

We introduce the Hadamard full propelinear codes that factorize as direct product of groups such that their associated group is $C_{2t}\times C_2$. We study the rank, the dimension of the kernel, and the structure of these codes. For…

We show that any binary $(n=2^m-3, 2^{n-m}, 3)$ code $C_1$ is a part of an equitable partition (perfect coloring) $\{C_1,C_2,C_3,C_4\}$ of the $n$-cube with the parameters $((0,1,n-1,0)(1,0,n-1,0)(1,1,n-4,2)(0,0,n-1,1))$. Now the…

The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of…

We show that $A_2(7,4) \leq 388$ and, more generally, $A_q(7,4) \leq (q^2-q+1)[7]_q + q^4 - 2q^3 + 3q^2 - 4q + 4$ by semidefinite programming for $q \leq 101$. Furthermore, we extend results by Bachoc et al. on SDP bounds for $A_2(n,d)$,…

A linear code with a complementary dual (or LCD code) is defined to be a linear code $C$ whose dual code $C^{\perp}$ satisfies $C \cap C^{\perp}$= $\left\{ \mathbf{0}\right\} $. Let $LCD{[}n,k{]}$ denote the maximum of possible values of…

Let $q$ be a prime power of the form $q=12c^2+4c+3$ with $c$ an arbitrary integer. In this paper we construct a difference family with parameters $(2q^2;q^2,q^2,q^2,q^2-1;2q^2-2)$ in ${\mathbb Z}_2\times ({\mathbb F}_{q^2},+)$. As a…

Let $p^k m^2$ be an odd perfect number with special prime $p$. In this article, we provide an alternative proof for the biconditional that $\sigma(m^2) \equiv 1 \pmod 4$ holds if and only if $p \equiv k \pmod 8$. We then give an application…

Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson, Kerdock, Preparata, Goethals, and Delsarte-Goethals. It is shown here that all these…

We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of…

An analytical method for getting new complex Hadamard matrices by using mutually unbiased bases and a nonlinear doubling formula is provided. The method is illustrated with the n=4 case that leads to a rich family of eight-dimensional…