English
Related papers

Related papers: Non-Invertible-Element Constacyclic Codes over Fin…

200 papers

For any constacyclic code over a finite commutative chain ring of length coprime to the characteristic of the ring, we construct explicitly generator polynomials and check polynomials, and exhibit a BCH bound for such constacyclic codes. As…

Information Theory · Computer Science 2021-05-21 Yun Fan

In this paper, we give an important isomorphism between contacyclic codes and cyclic codes over finite principal ideal rings. Necessary and sufficient conditions for the existence of non-trivial cyclic self-dual codes over finite principal…

Information Theory · Computer Science 2015-05-06 Aicha Batoul , Kenza Guenda , T. Aaron Gulliver

For any prime $p$, $\lambda$-constacyclic codes of length $p^s$ over ${\cal R}=\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}$ are precisely the ideals of the local ring ${\cal R}_{\lambda}=\frac{{\cal R}[x]}{\left\langle x^{p^s}-\lambda…

Information Theory · Computer Science 2016-12-13 Hongwei Liu , Maouche Youcef

For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some…

Information Theory · Computer Science 2012-12-18 Aicha Batoul , Kenza Guenda , T. Aaron Gulliver

Let $\mathbb{F}_{p^{m}}$ be a finite field with cardinality $p^{m}$ and $R=\mathbb{F}_{p^{m}}+u\mathbb{F}_{p^{m}}$ with $u^{2}=0$. We aim to determine all $\alpha+u\beta$-constacyclic codes of length $np^{s}$ over $R$, where…

Information Theory · Computer Science 2016-06-22 Wei Zhao , Xilin Tang , Ze Gu

In this paper we investigate codes over finite commutative rings R, whose generator matrices are built from \$\alpha\$-circulant matrices. For a non-trivial ideal I<R we give a method to lift such codes over R/I to codes over R, such that…

Combinatorics · Mathematics 2015-03-11 Michael Kiermaier , Alfred Wassermann

Let $\mathcal{R}_e$ be a finite commutative chain ring with nilpotency index $e \geq 2.$ In this paper, all repeated-root constacyclic codes of arbitrary lengths over $\mathcal{R}_{2},$ their sizes and their dual codes are determined. As an…

Commutative Algebra · Mathematics 2017-09-25 Anuradha Sharma , Tania Sidana

Let $R$ be a commutative local finite ring. In this paper, we construct the complete set of pairwise orthogonal primitive idempotents of $R[X]/<g>$ where $g$ is a regular polynomial in $R[X]$. We use this set to decompose the ring…

Information Theory · Computer Science 2019-08-21 Mohammed Elhassani Charkani , Joël Kabore

Many kinds of codes which possess two cycle structures over two special finite commutative chain rings, such as ${\Bbb Z}_2{\Bbb Z}_4$-additive cyclic codes and quasi-cyclic codes of fractional index etc., were proved asymptotically good.…

Information Theory · Computer Science 2022-03-11 Yun Fan , Hualu Liu

This study aims to determine the algebraic structures of $\alpha$-constacyclic codes of length $3p^s$ over the finite commutative non-chain ring $\mathcal{R}=\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}$, for a prime $p…

Combinatorics · Mathematics 2025-04-03 Divya Acharya , Prasanna Poojary , Vadiraja Bhatta G R

Let $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$, where $p$ is a prime, and $k, N$ be any positive integers. We denote $R_k=F_{p^m}[u]/\langle u^k\rangle =F_{p^m}+uF_{p^m}+\ldots+u^{k-1}F_{p^m}$ ($u^k=0$) and…

Information Theory · Computer Science 2017-03-17 Yuan Cao , Yonglin Cao

In this article, we study skew constacyclic codes over a class of finite commutative semisimple rings. The automorphism group of $\mathcal{R}=\prod_{i=1}^t F_q$ is determined, and we characterize skew constacyclic codes over ring by linear…

Information Theory · Computer Science 2022-06-06 Ying Zhao

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

Generalizing the linear complementary duals, the linear complementary pairs and the hull of codes, we introduce the concept of $\ell$-dimension linear intersection pairs ($\ell$-DLIPs) of codes over a finite commutative ring $(R)$, for some…

Information Theory · Computer Science 2023-06-22 Sanjit Bhowmick , Alexandre Fotue Tabue , Joydeb Pal

Let $\mathcal{R}=\mathbb{F}_{p^m}[u]/\langle u^3 \rangle $ be the finite commutative chain ring with unity, where $p$ is a prime, $m$ is a positive integer and $\mathbb{F}_{p^m}$ is the finite field with $p^m$ elements. In this paper, we…

Number Theory · Mathematics 2017-09-25 Anuradha Sharma , Tania Sidana

In this paper, several families of irreducible constacyclic codes over finite fields and their duals are studied. The weight distributions of these irreducible constacyclic codes and the parameters of their duals are settled. Several…

Information Theory · Computer Science 2022-07-06 Zhonghua Sun , Xiaoqiang Wang , Cunsheng Ding

In this paper, we shall give an explicit proof that constacyclic codes over finite commutative rings can be realized as ideals in some twisted group rings. Also, we shall study isometries between those codes and, finally, we shall study…

Information Theory · Computer Science 2023-07-26 Samir Assuena

In this paper we give the structure of constacyclic codes over formal power series and chain rings. We also present necessary and sufficient conditions on the existence of MDS codes over principal ideal rings. These results allow for the…

Information Theory · Computer Science 2012-07-17 Kenza Guenda , T. Aaron Gulliver

Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right…

Information Theory · Computer Science 2010-10-04 Somphong Jitman , San Ling , Patanee Udomkavanich

This paper investigates the application of the theoretical algebraic notion of a separable ring extension, in the realm of cyclic convolutional codes or, more generally, ideal codes. We work under very mild conditions, that cover all…

Information Theory · Computer Science 2014-08-08 José Gómez-Torrecillas , F. J. Lobillo , Gabriel Navarro
‹ Prev 1 2 3 10 Next ›