English
Related papers

Related papers: Z2Z4-Additive Cyclic Codes: Kernel and Rank

200 papers

Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…

Information Theory · Computer Science 2022-10-12 Ziling Heng , Xinran Wang , Xiaoru Li

In this paper, we study skew constacyclic codes over the ring $\mathbb{Z}_{q}R$ where $R=\mathbb{Z}_{q}+u\mathbb{Z}_{q}$, $q=p^{s}$ for a prime $p$ and $u^{2}=0$. We give the definition of these codes as subsets of the ring…

Information Theory · Computer Science 2018-10-16 Ahlem Melakhessou , Nuh Aydin , Kenza Guenda

In this paper, the investigation on the algebraic structure of the ring $\frac{\mathbb{F}_q[v]}{\langle\,v^q-v\,\rangle}$ and the description of its automorphism group, enable to study the algebraic structure of codes and their dual over…

Information Theory · Computer Science 2019-02-28 Joël Kabore , Alexandre Fotue-Tabue , Kenza Guenda , Mohammed E. Charkani

Quasi-polycyclic (QP for short) codes over a finite chain ring $R$ are a generalization of quasi-cyclic codes, and these codes can be viewed as an $R[x]$-submodule of $\mathcal{R}_m^{\ell}$, where $\mathcal{R}_m:= R[x]/\langle f\rangle$,…

Information Theory · Computer Science 2021-11-10 Rongsheng Wu , Minjia Shi , Patrick Solé

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…

Information Theory · Computer Science 2023-05-03 Tingfang Chen , Cunsheng Ding , Chengju Li , Zhonghua Sun

Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…

Information Theory · Computer Science 2017-02-02 Cem Güneri , Ferruh Özbudak , Buket Özkaya , Elif Saçıkara , Zahra Sepasdar , Patrick Solé

We study the rank weight hierarchy, thus in particular the rank metric, of cyclic codes over the finite field $\mathbb F_{q^m}$, $q$ a prime power, $m \geq 2$. We establish the rank weight hierarchy for $[n,n-1]$ cyclic codes and…

Information Theory · Computer Science 2014-07-16 Jérôme Ducoat , Frédérique Oggier

In this article, we study the algebraic structure of double cyclic codes of length $(m, n)$ over $\mathbb{F}_4$ and we give a necessary and sufficient condition for a double cyclic code over $\mathbb{F}_4$ to be reversible. Also, we…

Rings and Algebras · Mathematics 2025-12-16 Divya Acharya , Prasanna Poojary , Vadiraja Bhatta G. R

In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic…

Information Theory · Computer Science 2012-05-30 Morgan Barbier , Christophe Chabot , Guillaume Quintin

Let $F_2$ be the binary field and $Z_{2^r}$ the residue class ring of integers modulo $2^r$, where $r$ is a positive integer. For the finite $16$-element commutative local Frobenius non-chain ring $Z_4+uZ_4$, where $u$ is nilpotent of index…

Information Theory · Computer Science 2017-11-22 Virgilio P. Sison , Monica N. Remillion

Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…

Information Theory · Computer Science 2025-04-22 Mrinal Kanti Bose , Udaya Parampalli , Abhay Kumar Singh

This paper is concerned with construction and structural analysis of both cyclic and quasi-cyclic codes, particularly LDPC codes. It consists of three parts. The first part shows that a cyclic code given by a parity-check matrix in…

Information Theory · Computer Science 2010-12-16 Qin Huang , Qiuju Diao , Shu Lin , Khaled Abdel-Ghaffar

Linear complementary dual codes were defined by Massey in 1992, and were used to give an optimum linear coding solution for the two user binary adder channel. In this paper, we define the analog of LCD codes over fields in the ambient space…

Information Theory · Computer Science 2019-03-20 Nasreddine Benbelkacem , Joaquim Borges , Steven T. Dougherty , Cristina Fernández-Córdoba

Let $p$ be a prime number. In this paper, we study cyclic codes over the ring $ \Z_p[u, v]/\langle u^2, v^2, uv-vu\rangle$. We find a unique set of generators for these codes. We also study the rank and the Hamming distance of these codes.…

Information Theory · Computer Science 2014-06-05 Pramod Kumar Kewat , Bappaditya Ghosh , Sukhamoy Pattanayak

As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and…

Information Theory · Computer Science 2007-07-16 Eric Zhi Chen

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}$ $(u^2=0)$ and $s,n$ be positive integers such that $n$ is odd. In this paper, we give an explicit representation for every self-dual…

Information Theory · Computer Science 2019-07-17 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Fang-Wei Fu , Fanghui Ma

In this work, four circulant and quadratic double circulant (QDC) constructions are applied to the family of the rings R_k,m. Self-dual binary codes are obtained as the Gray images of self-dual QDC codes over R_k,m. Extremal binary…

Information Theory · Computer Science 2016-10-31 Abidin Kaya , Nesibe Tüfekçi

In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe…

Information Theory · Computer Science 2007-08-13 Heide Gluesing-Luerssen , Fai-Lung Tsang

A non-zero $\mathbb{F}$-linear map from a finite-dimensional commutative $\mathbb{F}$-algebra to $\mathbb{F}$ is called an $\mathbb{F}$-valued trace if its kernel does not contain any non-zero ideals. In this article, we utilize an…

Information Theory · Computer Science 2024-10-03 Anuj Kumar Bhagat , Ritumoni Sarma , Vidya Sagar

Let $R$ be a finite commutative chain ring with unique maximal ideal $\langle \gamma\rangle$, and let $n$ be a positive integer coprime with the characteristic of $R/\langle \gamma\rangle$. In this paper, the algebraic structure of cyclic…

Information Theory · Computer Science 2014-05-13 Bocong Chen , San Ling , Guanghui Zhang
‹ Prev 1 4 5 6 7 8 10 Next ›