Results 241 to 250 of about 226,788 (288)
Some of the next articles are maybe not open access.
n-Dimensional quasi-cyclic codes over finite chain rings
Journal of Applied Mathematics and Computing, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Shuyao +3 more
openaire +2 more sources
Maximal Codes for Finite Chain Rings
2019 International Conference on Advanced Communication Technologies and Networking (CommNet), 2019Coding theory is one of the bases of the information theory, this behind has experienced a spectacular evolution exploiting what has been achieved in the codes by the use of the concept of algebra. So to ensure a good transfer of information, it is better to use good codes by using a few aspects which represents an advantage. In this work, we will talk
M. Sabiri
openaire +2 more sources
Non-isomorphic pure finite chain rings
Afrika Matematika, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tabue, Alexandre Fotue +1 more
openaire +2 more sources
On the structure of 1-generator quasi-polycyclic codes over finite chain rings
Journal of Applied Mathematics and Computation, 2021Quasi-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 }$$ R m ℓ , where $${\mathcal {R}}_m:= R[x]/\langle f\rangle $$
Rongsheng Wu, Minjia Shi, Patrick Sol'e
semanticscholar +1 more source
Homogeneous Weight Distributions of Cyclic Codes Over Finite Chain Rings
IEEE Transactions on Information TheoryConstantinescu et al. introduced the homogeneous weight on the integer residue ring $\mathbb {Z}_{m}$ which can reflect more information compared with the Hamming weight.
Xiangrui Meng +3 more
semanticscholar +1 more source
A class of linear codes of length 2 over finite chain rings
Journal of Algebra and its Applications, 2020Let [Formula: see text] be a finite field of cardinality [Formula: see text], where [Formula: see text] is an odd prime, [Formula: see text] be positive integers satisfying [Formula: see text], and denote [Formula: see text], where [Formula: see text] is
Yonglin Cao +5 more
semanticscholar +1 more source
Finite maximal chains of commutative rings
Journal of Algebra and Its Applications, 2014Let R ⊆ S be a unital extension of commutative rings, with [Formula: see text] the integral closure of R in S, such that there exists a finite maximal chain of rings from R to S. Then S is a P-extension of R, [Formula: see text] is a normal pair, each intermediate ring of R ⊆ S has only finitely many prime ideals that lie over any given prime ideal of
Ayache, Ahmed, Dobbs, David E.
openaire +2 more sources
Trace duality and additive complementary pairs of additive cyclic codes over finite chain rings
Finite Fields Their Appl.This paper investigates the algebraic structure of additive complementary pairs of cyclic codes over a finite commutative ring. We demonstrate that for every additive complementary pair of additive cyclic codes, both constituent codes are free modules ...
Sanjit Bhowmick +3 more
semanticscholar +1 more source
MacWilliams duality for rank metric codes over finite chain rings
Finite Fields Their Appl.We extend Ravagnani's MacWilliams duality theory to the settings of rank metric codes over finite chain rings, relating the sequences of $q$-binomial moments of a rank metric code over this class of rings with those of its dual.
Iv'an Blanco-Chac'on +3 more
semanticscholar +1 more source
Remarks on finite pseudo-chain rings
Ricerche di MatematicaThe authors of this paper under review define the pseudo-chain rings, which is a slight generalization of pseudo-valuation rings defined in [\textit{A. Badawi} et al., Lect. Notes Pure Appl. Math. 185, 57--67 (1997; Zbl 0880.13011)], which is in turn a generalization of pseudo-valuation domains defined by \textit{J. R. Hedstrom} and \textit{E.
Boran Kim, Hyun Seung Choi
openaire +2 more sources