English
Related papers

Related papers: Self-Dual Codes over Z_2xZ_4

200 papers

In this work, we define composite matrices which are derived from group rings. We extend the idea of G-codes to composite G-codes. We show that these codes are ideals in a group ring, where the ring is a finite commutative Frobenius ring…

Information Theory · Computer Science 2020-02-27 Steven T. Dougherty , Joe Gildea , Adrian Korban , Abidin Kaya

In this paper a framework to study the dual of skew cyclic codes is proposed. The transposed Hamming ring extensions are based in the existence of an anti-isomorphism of algebras between skew polynomial rings. Our construction is applied to…

Information Theory · Computer Science 2018-03-02 José Gómez-Torrecillas , F. J. Lobillo , Gabriel Navarro

A classification of Hadamard matrices of order $2p+2$ with an automorphism of order $p$ is given for $p=29$ and $31$. The ternary self-dual codes spanned by the newly found Hadamard matrices of order $60$ with an automorphism of order $29$…

Combinatorics · Mathematics 2023-07-19 Makoto Araya , Masaaki Harada , Vladimir D. Tonchev

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é

Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…

Information Theory · Computer Science 2025-11-25 Dongmei Huang , Qunying Liao , Sihem Mesnager , Gaohua Tang , Haode Yan

The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…

Combinatorics · Mathematics 2007-05-23 E. Martinez-Moro , I. F. Rua

Self-dual codes over finite fields and over some finite rings have been of interest and extensively studied due to their nice algebraic structures and wide applications. Recently, characterization and enumeration of Euclidean self-dual…

Information Theory · Computer Science 2019-09-10 Parinyawat Choosuwan , Somphong Jitman

We introduce quaternary modified four $\mu$-circulant codes as a modification of four circulant codes. We give basic properties of quaternary modified four $\mu$-circulant Hermitian self-dual codes. We also construct quaternary modified…

Information Theory · Computer Science 2024-01-30 Masaaki Harada

Self-dual double circulant codes of odd dimension are shown to be dihedral in even characteristic and consta-dihedral in odd characteristic. Exact counting formulae are derived for them and used to show they contain families of codes with…

Information Theory · Computer Science 2016-03-03 Adel Alahmadi , Funda Özdemir , Patrick Solé

Linear codes over finite rings become one of hot topics in coding theory after Hommons et al.([4], 1994) discovered that several remarkable nonlinear binary codes with some linear-like properties are the images of Gray map of linear codes…

Information Theory · Computer Science 2016-03-08 Aixian Zhang , Jin Li , Keqin Feng

We classify all $q$-ary $\Delta$-divisible linear codes which are spanned by codewords of weight $\Delta$. The basic building blocks are the simplex codes, and for $q=2$ additionally the first order Reed-Muller codes and the parity check…

Combinatorics · Mathematics 2023-05-23 Michael Kiermaier , Sascha Kurz

A classification of extremal double circulant self-dual codes of lengths up to $88$ is known. We give a classification of extremal double circulant self-dual codes of lengths $90,92,94$ and $96$. We also classify double circulant self-dual…

Combinatorics · Mathematics 2017-03-22 T. Aaron Gulliver , Masaaki Harada

A binary linear code whose permutation automorphism group has a fixed point free permutation of order $3$ is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let $C$ be a…

Information Theory · Computer Science 2026-01-07 Murat Altunbulak , Fatma Altunbulak Aksu , Roghayeh Hafezieh , İpek Tuvay

We discuss a class of binary cyclic codes and their dual codes. The minimum distance is determined using algebraic geometry, and an application of Weil's theorem. We relate the weights appearing in the dual codes to the number of rational…

Number Theory · Mathematics 2007-05-23 Gary McGuire , Jose Felipe Voloch

In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…

Information Theory · Computer Science 2021-11-11 Martino Borello , Wolfgang Willems

The ring in the title is the first non commutative ring to have been used as alphabet for block codes. The original motivation was the construction of some quaternionic modular lattices from codes. The new application is the construction of…

Information Theory · Computer Science 2012-02-01 Adel Alahmadi , Patrick Solé , Houda Sboui , Olfa Yemen

In this paper we define $\mathbb{Z}_{2}\mathbb{Z}_{4}-$Simplex and MacDonald Codes of type $\alpha $ and $\beta $ and we give the covering radius of these codes.

Information Theory · Computer Science 2015-05-01 K. Chatouh , K. Guenda , T. A. Gulliver , L. Noui

Let $m$ be an arbitrary positive integer and $D_{8m}$ be a dihedral group of order $8m$, i.e., $D_{8m}=\langle x,y\mid x^{4m}=1, y^2=1, yxy=x^{-1}\rangle$. Left ideals of the dihedral group algebra $\mathbb{F}_2[D_{8m}]$ are called binary…

Information Theory · Computer Science 2019-08-12 Yuan Cao , Yonglin Cao , Fang-Wei Fu , Jian Gao

There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…

Information Theory · Computer Science 2012-01-31 Sunghyu Han , Jon-Lark Kim , Heisook Lee , Yoonjin Lee

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