中文
相关论文

相关论文: Z4-Linear Perfect Codes

200 篇论文

A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 is presented. There are 5983 such inequivalent perfect codes and 2165 extended perfect codes. Efficient…

信息论 · 计算机科学 2015-03-13 Patric R. J. Östergård , Olli Pottonen

In this work the construction of LRC codes given in [6] is completed, in the case of even characteristic. A general construction is presented, that enables us to obtain linear LRC codes of large length $n \approx q^4$, dimension and…

信息论 · 计算机科学 2026-04-07 Francisco Galluccio

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…

组合数学 · 数学 2013-01-23 Masaaki Harada , Tsuyoshi Miezaki

In this note, we demonstrate that every binary doubly even self-dual code of length $40$ can be realized as the residue code of some extremal Type II $\mathbb{Z}_4$-code. As a consequence, it is shown that there are at least $94356$…

组合数学 · 数学 2017-06-13 Masaaki Harada

Let $R=\mathbb{Z}_{4}[u]/\langle u^k\rangle=\mathbb{Z}_{4}+u\mathbb{Z}_{4}+\ldots+u^{k-1}\mathbb{Z}_{4}$ ($u^k=0$) where $k\in \mathbb{Z}^{+}$ satisfies $k\geq 2$. For any odd positive integer $n$, it is known that cyclic codes over $R$ of…

信息论 · 计算机科学 2016-06-17 Cao Yuan , Li Qingguo

In this paper we provide a large family of rank-metric codes, which contains properly the codes recently found by Longobardi and Zanella (2021) and by Longobardi, Marino, Trombetti and Zhou (2021). These codes are…

信息论 · 计算机科学 2021-04-16 Alessandro Neri , Paolo Santonastaso , Ferdinando Zullo

It is shown that the residue code of a self-dual $\mathbb{Z}_4$-code of length $24k$ (resp.\ $24k+8$) and minimum Lee weight $8k+4 \text{ or }8k+2$ (resp.\ $8k+8 \text{ or }8k+6$) is a binary extremal doubly even self-dual code for every…

组合数学 · 数学 2015-03-17 Masaaki Harada

We consider extended $1$-perfect codes in Hamming graphs $H(n,q)$. Such nontrivial codes are known only when $n=2^k$, $k\geq 1$, $q=2$, or $n=q+2$, $q=2^m$, $m\geq 1$. Recently, Bespalov proved nonexistence of extended $1$-perfect codes for…

组合数学 · 数学 2025-03-24 Konstantin Vorob'ev

It is conjectured by Golomb and Welch around half a century ago that there is no perfect Lee codes $C$ of packing radius $r$ in $\mathbb{Z}^{n}$ for $r\geq2$ and $n\geq 3$. Recently, Leung and the second author proved this conjecture for…

组合数学 · 数学 2022-10-11 Zijiang Zhou , Yue Zhou

For each r, 0 <= r <= m, it is presented the class of quaternary linear codes LRM(r,m) whose images under the Gray map are binary codes with parameters of Reed-Muller RM(r,m) code of order r.

组合数学 · 数学 2007-05-23 Faina I. Solov'eva

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…

组合数学 · 数学 2012-05-28 Masaaki Harada

We prove that the class of $\Z_2\Z_2[u]$-linear codes is exactly the class of $\Z_2$-linear codes with automorphism group of even order. Using this characterization, we give examples of known codes, e.g. perfect codes, which has a…

组合数学 · 数学 2016-11-18 Joaquim Borges

We consider quasi-perfect codes in $\mathbb{Z}^n$ over the $\ell_p$ metric, $2 \leq p < \infty$. Through a computational approach, we determine all radii for which there are linear quasi-perfect codes for $p = 2$ and $n = 2, 3$. Moreover,…

信息论 · 计算机科学 2015-09-18 João E. Strapasson , Grasiele C. Jorge , Antonio Campello , Sueli I. R. Costa

A Type IV-II Z4-code is a self-dual code over Z4 with the property that all Euclidean weights are divisible by eight and all codewords have even Hamming weight. In this paper we use generalized bent functions for a construction of…

信息论 · 计算机科学 2022-11-03 Sara Ban , Sanja Rukavina

We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.

组合数学 · 数学 2015-10-20 Roland Bacher

We establish a connection between linear complementary dual (LCD) codes and caps in projective space. Using this framework and the structure theory of maximal caps, we derive nonexistence theorems for LCD codes with minimum distance at…

信息论 · 计算机科学 2026-04-07 Keita Ishizuka , Yuhi Kamio

We give a complete classification of binary linear complementary dual codes of lengths up to $13$ and ternary linear complementary dual codes of lengths up to $10$.

组合数学 · 数学 2020-11-20 Makoto Araya , Masaaki Harada

Extended $1$-perfect codes in the Hamming scheme $H(n,q)$ can be equivalently defined as codes that turn to $1$-perfect codes after puncturing in any coordinate, as completely regular codes with certain intersection array, as uniformly…

组合数学 · 数学 2024-08-30 Evgeny A. Bespalov , Denis S. Krotov

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

组合数学 · 数学 2015-03-17 Masaaki Harada

We study additive quaternary codes whose parameters are close to those of the extended cyclic [12; 6; 6]4-code or to the quaternary linear codes generated by the elliptic quadric in PG(3; 4) or its dual. In particular we characterize those…

组合数学 · 数学 2018-04-10 Juergen Bierbrauer , Stefano Marcugini , Fernanda Pambianco