English
Related papers

Related papers: $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-Additive Ha…

200 papers

A linear code is linear complementary dual (LCD) if it meets its dual trivially. LCD codes have been a hot topic recently due to Boolean masking application in the security of embarked electronics (Carlet and Guilley, 2014). Additive codes…

Information Theory · Computer Science 2022-07-06 Minjia Shi , Na Liu , Jon-Lark Kim , Patrick Solé

One of the most promising structural approaches to resolving the Hadamard Conjecture uses the family of cocyclic matrices over ${\mathbb Z} _t \times {\mathbb Z}_2^2$. Two types of equivalence relations for classifying cocyclic matrices…

Combinatorics · Mathematics 2015-01-28 V. Alvarez , F. Gudiel , M. B. Guemes , K. J. Horadam , A. Rao

In this paper we study Z2Z4Z8-additive codes, which are the extension of recently introduced Z2Z4-additive codes. We determine the standard forms of the generator and parity-check matrices of Z2Z4Z8-additive codes. Moreover, we investigate…

Information Theory · Computer Science 2017-04-25 Ismail Aydogdu , Fatmanur Gursoy

A ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive code ${\cal C}\subseteq{\mathbb{Z}}_2^\alpha\times{\mathbb{Z}}_4^\beta$ is called cyclic if the set of coordinates can be partitioned into two subsets, the set of ${\mathbb{Z}}_2$ and the set of…

Information Theory · Computer Science 2016-06-07 Joaquim Borges Ayats , Cristina Fernández-Córdoba , Roger Ten-Valls

A classic result of Delsarte connects the strength (as orthogonal array) of a linear code with the minimum weight of its dual: the former is one less than the latter. We show that Delsarte's observation extends to codes over arbitrary…

Combinatorics · Mathematics 2019-05-31 Peter J. Cameron , Josephine Kusuma , Patrick Solé

A Z2Z4-additive code C is called cyclic if the set of coordinates can be partitioned into two subsets, the set of Z_2 and the set of Z_4 coordinates, such that any cyclic shift of the coordinates of both subsets leaves the code invariant.…

Information Theory · Computer Science 2017-07-12 J. Borges , S. T. Dougherty , C. Fernández-Córdoba , R. Ten-Valls

Linear complementary dual (LCD) codes over finite fields are linear codes satisfying $C\cap C^{\perp}=\{0\}$. We generalize the LCD codes over finite fields to $\mathbb{Z}_2\mathbb{Z}_2[u]$-LCD codes over the ring…

Information Theory · Computer Science 2019-03-28 Hu Peng , Liu Xiusheng

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

In this paper, we study one-Lee weight and two-Lee weight codes over $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$, where $u^{2}=0$. Some properties of one-Lee weight $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-additive codes are given, and a complete…

Rings and Algebras · Mathematics 2018-02-05 Zhenliang Lu , Liqi Wang , Shixin Zhu , Xiaoshan Kai

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…

Combinatorics · Mathematics 2018-04-10 Juergen Bierbrauer , Stefano Marcugini , Fernanda Pambianco

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 new generalization of the Gray map is introduced. The new generalization $\Phi: Z_{2^k}^n \to Z_{2}^{2^{k-1}n}$ is connected with the known generalized Gray map $\phi$ in the following way: if we take two dual linear $Z_{2^k}$-codes and…

Combinatorics · Mathematics 2009-10-05 Denis Krotov

In this work, we investigate additive complementary dual (ACD) codes and their construction over finite fields $\mathbb{F}_{q^2}$ with respect to the trace inner products, where $q$ is a prime power. First, we associate an additive code…

Information Theory · Computer Science 2025-10-21 Gyanendra K. Verma , R. K. Sharma

We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these…

Combinatorics · Mathematics 2008-01-09 Lars Eirik Danielsen , Matthew G. Parker

In this note, we study the classification of $\mathbb{Z}_4$-codes. For some special cases $(k_1,k_2)$, by hand, we give a classification of $\mathbb{Z}_4$-codes of length $n$ and type $4^{k_1}2^{k_2}$ satisfying a certain condition. Our…

Combinatorics · Mathematics 2017-11-09 Makoto Araya , Masaaki Harada , Hiroki Ito , Ken Saito

We investigate additive cyclic codes over the alphabet $\mathbb{F}_{q}\mathbb{F}_{q^2}$, where $q$ is a prime power. First, its generator polynomials and minimal spanning set are determined. Then, examples of $\mathbb{F}_{q^2}$-additive…

Information Theory · Computer Science 2025-11-05 Ankit Yadav , Ritumoni Sarma

Research on codes over finite rings has intensified since the discovery in 1994 of the fact that some best binary non-linear codes can be obtained as images of $\mathbb{Z}_4$-linear codes. Codes over many different finite rings has been a…

Information Theory · Computer Science 2022-08-16 Nuh Aydin , Yiang Lu , Vishad R. Onta

It has been observed by Assmus and Key as a result of the complete classification of Hadamard matrices of order 24, that the extremality of the binary code of a Hadamard matrix H of order 24 is equivalent to the extremality of the ternary…

Combinatorics · Mathematics 2017-10-20 Akihiro Munemasa , Hiroki Tamura

We consider the symmetry group of a $Z_2Z_4$-linear code with parameters of a $1$-perfect, extended $1$-perfect, or Preparata-like code. We show that, provided the code length is greater than $16$, this group consists only of symmetries…

Information Theory · Computer Science 2017-03-01 Denis Krotov

Let ${\cal C}$ be a ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive code of length $n > 3$. We prove that if the binary Gray image of ${\cal C}$, $C=\Phi({\cal C})$, is a 1-perfect nonlinear code, then ${\cal C}$ cannot be a…

Combinatorics · Mathematics 2015-10-22 Joaquim Borges , Cristina Fernández-Córdoba