English
Related papers

Related papers: On dual codes in the Doob schemes

200 papers

Linear codes are considered over the ring Z_4+uZ_4, a non-chain extension of Z_4. Lee weights, Gray maps for these codes are defined and MacWilliams identities for the complete, symmetrized and Lee weight enumerators are proved. Two…

Rings and Algebras · Mathematics 2013-07-12 Bahattin Yildiz , Suat Karadeniz

The MacWilliams Identity is a well established theorem relating the weight enumerator of a code to the weight enumerator of its dual. The ability to use a known weight enumerator to generate the weight enumerator of another through a simple…

Information Theory · Computer Science 2024-01-17 Izzy Friedlander

The Doob graph $D(m,n)$ is the Cartesian product of $m>0$ copies of the Shrikhande graph and $n$ copies of the complete graph of order $4$. Naturally, $D(m,n)$ can be represented as a Cayley graph on the additive group $(Z_4^2)^m \times…

Information Theory · Computer Science 2019-07-02 Minjia Shi , Daitao Huang , Denis S. Krotov

The MacWilliams identity, which relates the weight distribution of a code to the weight distribution of its dual code, is useful in determining the weight distribution of codes. In this paper, we derive the MacWilliams identity for linear…

Information Theory · Computer Science 2007-11-28 Maximilien Gadouleau , Zhiyuan Yan

This paper investigates the relationship between the rank weight distribution of a linear code and that of its dual code. The main result of this paper is that, similar to the MacWilliams identity for the Hamming metric, the rank weight…

Information Theory · Computer Science 2007-07-13 Maximilien Gadouleau , Zhiyuan Yan

Past few years have seen an extensive use of RAM chips with wide I/O data (e.g. 16, 32, 64 bits) in computer memory systems. These chips are highly vulnerable to a special type of byte error, called an $m$-spotty byte error, which can be…

Information Theory · Computer Science 2013-07-10 Minjia Shi

We study $1$-perfect codes in Doob graphs $D(m,n)$. We show that such codes that are linear over $GR(4^2)$ exist if and only if $n=(4^{g+d}-1)/3$ and $m=(4^{g+2d}-4^{g+d})/6$ for some integers $g \ge 0$ and $d>0$. We also prove necessary…

Combinatorics · Mathematics 2016-06-06 Denis Krotov

A MacWilliams Identity for convolutional codes will be established. It makes use of the weight adjacency matrices of the code and its dual, based on state space realizations (the controller canonical form) of the codes in question. The…

Information Theory · Computer Science 2008-05-23 Heide Gluesing-Luerssen , Gert Schneider

Burst errors are very common in practice. There have been many designs in order to control and correct such errors. Recently, a new class of byte error control codes called spotty byte error control codes has been specifically designed to…

Information Theory · Computer Science 2013-02-04 Mehmet Ozen , Vedat Şiap

The adjacency matrix associated with a convolutional code collects in a detailed manner information about the weight distribution of the code. A MacWilliams Identity Conjecture, stating that the adjacency matrix of a code fully determines…

Information Theory · Computer Science 2007-07-13 Heide Gluesing-Luerssen , Gert Schneider

In this article, we illustrate an algorithm for the computation of the weight distribution of CRC codes. The recursive structure of CRC codes will give us an iterative way to compute the weight distribution of their dual codes starting from…

Information Theory · Computer Science 2007-07-13 Felice Manganiello

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…

Information Theory · Computer Science 2009-10-19 J. Borges , S. T. Dougherty , C. Fernandez-Cordoba

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

In this paper, we have introduced the concepts of support distribution and the support enumerator as refinements of the classical weight distribution and weight enumerator respectively, capturing coordinate level activity in linear block…

Information Theory · Computer Science 2026-01-14 Nitin Kenjale , Anuradha S. Garge

The Doob graph $D(m,n)$, where $m>0$, is the direct product of $m$ copies of The Shrikhande graph and $n$ copies of the complete graph $K_4$ on $4$ vertices. The Doob graph $D(m,n)$ is a distance-regular graph with the same parameters as…

Combinatorics · Mathematics 2017-07-18 Evgeny Bespalov , Denis Krotov

In 1962, Jesse MacWilliams published a set of formulas for linear and abelian group codes that among other applications, were incredibly valuable in the study of self-dual codes. Now called the MacWilliams Identities, her results relate the…

Information Theory · Computer Science 2024-02-28 Prairie Wentworth-Nice

The punctured dodecacode is an additive $4$-ary code of length $11$ and distance $5$ which is uniformly packed. We show that a code with the same weight distribution is equivalent to it. This code is also shown to be nonlinear. We also…

Combinatorics · Mathematics 2026-01-14 Markus Grassl , Denis Krotov , Lin Sok , Patrick Solé

Linear codes are considered over the ring $\mathbb{Z}_4+v\mathbb{Z}_4$, where $v^2=v$. Gray weight, Gray maps for linear codes are defined and MacWilliams identity for the Gray weight enumerator is given. Self-dual codes, construction of…

Information Theory · Computer Science 2015-01-05 Jian Gao , Yun Gao , Fang-Wei Fu

A fundamental property of codes, the second-order weight distribution, is proposed to solve the problems such as computing second moments of weight distributions of linear code ensembles. A series of results, parallel to those for weight…

Information Theory · Computer Science 2011-11-15 Shengtian Yang

We introduce a general class of regular weight functions on finite abelian groups, and study the combinatorics, the duality theory, and the metric properties of codes endowed with such functions. The weights are obtained by composing a…

Information Theory · Computer Science 2017-11-01 Alberto Ravagnani
‹ Prev 1 2 3 10 Next ›