English
Related papers

Related papers: Z2Z4-linear codes: generator matrices and duality

200 papers

In the paper, we firstly study the algebraic structures of $\mathbb{Z}_p \mathbb{Z}_{p^k}$-additive cyclic codes and give the generator polynomials and the minimal spanning set of these codes. Secondly, a necessary and sufficient condition…

Information Theory · Computer Science 2022-10-24 Minjia Shi , Xuan Wang

Inspired by the Z2Z4-additive codes, linear codes over Z2^r x(Z2+uZ2)^s have been introduced by Aydogdu et al. more recently. Although these family of codes are similar to each other, linear codes over Z2^r x(Z2+uZ2)^s have some advantages…

Information Theory · Computer Science 2017-04-25 Ismail Aydogdu

In this work, we define three composite matrices derived from group rings. We employ these composite matrices to create generator matrices of the form [In | {\Omega}(v)], where In is the identity matrix and {\Omega}(v) is a composite matrix…

Information Theory · Computer Science 2021-02-02 Adrian Korban , Serap Sahinkaya , Deniz Ustun

This paper investigates the concept of self-dual convolutional code. We derive the basic properties of this interesting class of codes and we show how some of the techniques to construct self-dual linear block codes generalize to self-dual…

Information Theory · Computer Science 2022-08-09 Sebastian Heri , Julia Lieb , Joachim Rosenthal

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

Four circulant codes form a special class of $2$-generator, index $4$, quasi-cyclic codes. Under some conditions on their generator matrices they can be shown to be self-dual. Artin primitive root conjecture shows the existence of an…

Information Theory · Computer Science 2017-09-25 Minjia Shi , Hongwei Zhu , Patrick Sole

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

In this paper, we examine the binary linear codes with respect to Hamming metric from incidence matrix of a unit graph $G(\mathbb{Z}_{n})$ with vertex set is $\mathbb{Z}_{n}$ and two distinct vertices $x$ and $y$ being adjacent if and only…

Information Theory · Computer Science 2020-11-11 N. Annamalai , C Durairajan

We introduce an altered version of the four circulant construction over group rings for self-dual codes. We consider this construction over the binary field, the rings F_2 + uF_2 and F_4 + uF_4; using groups of order 3, 7, 9, 13, and 15.…

Combinatorics · Mathematics 2019-12-30 Joe Gildea , Abidin Kaya , Alexander Tylyshchak , Bahattin Yildiz

The $\Z_{p^s}$-additive codes of length $n$ are subgroups of $\Z_{p^s}^n$, and can be seen as a generalization of linear codes over $\Z_2$, $\Z_4$, or $\Z_{2^s}$ in general. A $\Z_{p^s}$-linear generalized Hadamard (GH) code is a GH code…

Information Theory · Computer Science 2022-03-30 Dipak K. Bhunia , Cristina Fernández-Córdoba , Carlos Vela , Mercè Villanueva

We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…

Combinatorics · Mathematics 2018-04-20 Alessio Meneghetti

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

An additive code is an $\mathbb{F}_q$-linear subspace of $\mathbb{F}_{q^m}^n$ over $\mathbb{F}_{q^m}$, which is not a linear subspace over $\mathbb{F}_{q^m}$. Linear complementary pairs (LCP) of codes have important roles in cryptography,…

Information Theory · Computer Science 2024-09-26 Sanjit Bhowmick , Deepak Kumar Dalai

In this work, extension theorems are generalized to self-dual codes over rings and as applications many new binary self-dual extremal codes are found from self-dual codes over F_2^m+uF_2^m for m = 1, 2. The duality and distance preserving…

Information Theory · Computer Science 2016-11-26 Abidin Kaya , Bahattin Yildiz

Many generator matrices for constructing extremal binary self-dual codes of different lengths have the form G=(I|A), where I is the n by n identity matrix and A is the n by n matrix fully determined by the first row. In this work, we define…

Information Theory · Computer Science 2020-03-12 Maria Bortos , Joe Gildea , Abidin Kaya , Adrian Korban , Alexander Tylyshchak

We present some basic theory on the duality of codes over two non-unital rings of order $6$, namely $H_{23}$ and $H_{32}$. For a code $\mathcal{C}$ over these rings, we associate a binary code $\mathcal{C}_a$ and a ternary code…

Information Theory · Computer Science 2025-02-26 Altaf Alshuhail , Rowena Alma Betty , Lucky Galvez

We investigate linear codes over the ring $\mathbb{Z}_4 + u\mathbb{Z}_4 + v\mathbb{Z}_4 + w\mathbb{Z}_4 + uv\mathbb{Z}_4 + uw\mathbb{Z}_4 + vw\mathbb{Z}_4 + uvw\mathbb{Z}_4$, with conditions $u^2=u$, $v^2=v$, $w^2=w$, $uv=vu$, $uw=wu$ and…

Information Theory · Computer Science 2019-04-26 Bustomi , Aditya Purwa Santika , Djoko Suprijanto

The rings $Z_{4}+\nu Z_{4}$ have been classified into chain rings and non-chain rings on the basis of the values of $\nu^{2} \in Z_{4}+\nu Z_{4}.$ In this paper, the structure of cyclic codes of arbitrary length over the rings $Z_{4}+\nu…

Information Theory · Computer Science 2023-03-15 Nikita Jain , Sucheta Dutt , Ranjeet Sehmi

Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two…

Combinatorics · Mathematics 2019-03-07 J. Borges , J. Rifà , V. A. Zinoviev

This paper explores extremal self-dual double circulant (DC) codes and linear complementary dual (LCD) codes of arbitrary length over the Galois field $\mathbb F_2$. We establish the sufficient and necessary conditions for DC codes and…

Information Theory · Computer Science 2025-02-21 Wenyu Han , Tongjiang Yan , Ming Yan
‹ Prev 1 3 4 5 6 7 10 Next ›