English
Related papers

Related papers: Double Toeplitz codes and their average weight enu…

200 papers

This paper develops an algorithmic approach for obtaining estimates of the weight enumerators of Reed-Muller (RM) codes. Our algorithm is based on a technique for estimating the partition functions of spin systems, which in turn employs a…

Information Theory · Computer Science 2024-03-12 Shreyas Jain , V. Arvind Rameshwar , Navin Kashyap

The weight distribution of error correction codes is a critical determinant of their error-correcting performance, making enumeration of utmost importance. In the case of polar codes, the minimum weight $\wm$ (which is equal to minimum…

Information Theory · Computer Science 2023-05-05 Mohammad Rowshan , Vlad-Florin Drăgoi , Jinhong Yuan

Linear codes with a few weights are an important class of codes in coding theory and have attracted a lot of attention. In this paper, we present several constructions of $q$-ary linear codes with two or three weights from vectorial…

Information Theory · Computer Science 2022-07-26 Jiaxin Wang , Zexia Shi , Yadi Wei , Fang-Wei Fu

We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the non-chain ring $\mathbb{F}_p+u\mathbb{F}_p+v\mathbb{F}_p+uv\mathbb{F}_p,$ where $u^2=0,v^2=0,uv=vu.$ These codes are defined as trace codes. They have the…

Information Theory · Computer Science 2016-12-02 Yan Liu , Minjia Shi , Patrick Solé

In this paper, we present examples of codes all of whose weight classes support 1-designs, with duals whose classes include two that support 2-designs. We can find these examples in the triply even binary codes of length 48, which have been…

Combinatorics · Mathematics 2020-02-27 Tsuyoshi Miezaki , Hiroyuki Nakasora

In this paper, several classes of three-weight ternary linear codes from non-weakly regular dual-bent functions are constructed based on a generic construction method. Instead of the whole space, we use the subspaces $B_+(f)$ or $B_-(f)$…

Information Theory · Computer Science 2022-01-19 Rumi Melih Pelen

We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…

Information Theory · Computer Science 2022-09-29 Angelo Marotta

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…

Information Theory · Computer Science 2022-11-03 Sara Ban , Sanja Rukavina

In this paper, two different Gray-like maps from $Z_p^\alpha\times Z_{p^k}^\beta$, where $p$ is prime, to $Z_p^n$, $n={\alpha+\beta p^{k-1}}$, denoted by $\phi$ and $\Phi$, respectively, are presented. We have determined the connection…

Information Theory · Computer Science 2020-02-18 Minjia Shi , Rongsheng Wu , Denis S. Krotov

The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. In this paper, we investigate the generalized Hamming weights of two classes of linear codes constructed from defining sets and determine them completely…

Information Theory · Computer Science 2019-05-08 Gaopeng Jian

The paper describes a method to determine symmetrized weight enumerators of $p^m$-linear codes based on the notion of a disjoint weight enumerator. Symmetrized weight enumerators are given for the lifted quadratic residue codes of length 24…

Combinatorics · Mathematics 2007-07-16 I. M. Duursma , M. Greferath

Self-dual binary linear codes have been extensively studied and classified for length n <= 40. However, little attention has been paid to linear codes that coincide with their orthogonal complement when the underlying inner product is not…

Information Theory · Computer Science 2026-05-12 Patrick King , Mikhail Kotchetov

In this note, we give some restrictions on the number of vectors of weight $d/2+1$ in the shadow of a singly even self-dual $[n,n/2,d]$ code. This eliminates some of the possible weight enumerators of singly even self-dual $[n,n/2,d]$ codes…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada , Akihiro Munemasa

Recently, minimal linear codes have been extensively studied due to their applications in secret sharing schemes, secure two-party computations, and so on. Constructing minimal linear codes violating the Ashikhmin-Barg condition and then…

Information Theory · Computer Science 2022-01-11 Haibo Liu , Qunying Liao

The duals of cyclic codes with two zeros have been extensively studied, and their weight distributions have recently been evaluated in some cases. In this note, we determine the weight distribution of a certain new class of such codes by…

Combinatorics · Mathematics 2012-06-18 Tao Feng , Koji Momihara

For every linear binary code $C$, we construct a geometric triangular configuration $\Delta$ so that the weight enumerator of $C$ is obtained by a simple formula from the weight enumerator of the cycle space of $\Delta$. The triangular…

Combinatorics · Mathematics 2010-08-23 Pavel Rytíř

In this paper, we present four constructions of {general} self-orthogonal matrix-product codes associated with Toeplitz matrices. The first one relies on the {dual} of a known {general} dual-containing matrix-product code; the second one is…

Information Theory · Computer Science 2024-11-26 Yang Li , Shixin Zhu , Edgar Martínez-Moro

In this paper we investigate some dual algebraic-geometric codes associated with the Giulietti-Korchm\'aros maximal curve. We compute the minimum distance and the minimum weight codewords of such codes and we investigate the generalized…

Information Theory · Computer Science 2019-09-19 Edoardo Ballico , Matteo Bonini

Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power…

Information Theory · Computer Science 2016-05-12 Ziling Heng , Qin Yue

In order to construct quantum $[[n,0,d]]$ codes for $(n,d)=(56,15)$, $(57,15)$, $(58,16)$, $(63,16)$, $(67,17)$, $(70,18)$, $(71,18)$, $(79,19)$, $(83,20)$, $(87,20)$, $(89,21)$, $(95,20)$, we construct self-dual additive…

Combinatorics · Mathematics 2016-11-16 Markus Grassl , Masaaki Harada