Results 1 to 10 of about 226,788 (288)
On Double Cyclic Codes over Finite Chain Rings for DNA Computing [PDF]
EntropyLet e be a fixed positive integer and n1,n2 be odd positive integers. The main objective of this article is to investigate the algebraic structure of double cyclic codes of length (n1,n2) over the finite chain ring Re = F4e+vF4e, where v2=0.
Shakir Ali +4 more
doaj +3 more sources
Some Constacyclic Codes over Finite Chain Rings [PDF]
Advances in Mathematics of Communications, 2012 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 constacylic codes.
Batoul, Aicha +2 more
core +4 more sources
Density of free modules over finite chain rings [PDF]
Linear Algebra and its Applications, 2022 In this paper we focus on modules over a finite chain ring $\mathcal{R}$ of size $q^s$. We compute the density of free modules of $\mathcal{R}^n$, where we separately treat the asymptotics in $n,q$ and $s$. In particular, we focus on two cases: one where we fix the length of the module and one where we fix the rank of the module.
Eimear Byrne +3 more
openaire +4 more sources
Determinants of some special matrices over commutative finite chain rings [PDF]
Special Matrices, 2020 Circulant matrices over finite fields and over commutative finite chain rings have been of interest due to their nice algebraic structures and wide applications. In many cases, such matrices over rings have a closed connection with diagonal matrices over
Jitman Somphong
doaj +2 more sources
Constacyclic Codes over Finite Chain Rings of Characteristic p
Axioms, 2021 Let R be a finite commutative chain ring of characteristic p with invariants p,r, and k. In this paper, we study λ-constacyclic codes of an arbitrary length N over R, where λ is a unit of R.
Sami Alabiad, Yousef Alkhamees
doaj +2 more sources
Maximum Sum-Rank Distance Codes Over Finite Chain Rings [PDF]
IEEE Transactions on Information Theory, 2021 In this work, maximum sum-rank distance (MSRD) codes and linearized Reed-Solomon codes are extended to finite chain rings. It is proven that linearized Reed-Solomon codes are MSRD over finite chain rings, extending the known result for finite fields.
Umberto Martínez-Peñas, Sven Puchinger
openaire +4 more sources
Reversible cyclic codes over finite chain rings [PDF]
arXiv.org, 2023 In this paper, necessary and sufficient conditions for the reversibility of a cyclic code of arbitrary length over a finite commutative chain ring have been derived. MDS reversible cyclic codes having length p^s over a finite chain ring with nilpotency index 2 have been characterized and a few examples of MDS reversible cyclic codes have been presented.
Dalal, Monika +2 more
openaire +3 more sources
On Multiplicative Matrix Channels over Finite Chain Rings [PDF]
Journal of Communication and Information Systems, 2013 Motivated by physical-layer network coding, this paper considers communication in multiplicative matrix channels over finite chain rings. Such channels are defined by the law $Y =A X$, where $X$ and $Y$ are the input and output matrices, respectively ...
Feng, Chen +3 more
core +3 more sources
On Automorphism Groups of Finite Chain Rings [PDF]
Symmetry, 2021 A finite ring with an identity is a chain ring if its lattice of left ideals forms a unique chain. Let R be a finite chain ring with invaraints p,n,r,k,k′,m. If n=1, the automorphism group Aut(R) of R is known. The main purpose of this article is to study the structure of Aut(R) when n>1. First, we prove that Aut(R) is determined by the automorphism
Sami Alabiad, Yousef Alkhamees
openaire +2 more sources
On classification of finite commutative chain rings
AIMS Mathematics, 2022 Let $ R $ be a finite commutative chain ring with invariants $ p, n, r, k, m. $ It is known that $ R $ is an extension over a Galois ring $ GR(p^n, r) $ by an Eisenstein polynomial of some degree $ k $.
Sami Alabiad, Yousef Alkhamees
doaj +2 more sources