Results 31 to 40 of about 158,948 (278)
Advances in Mechanical Engineering, 2019 Crack initiation characteristics of ring chain of heavy-duty scraper conveyor under time-varying loads were investigated in this study. The dynamic tension of ring chain of the heavy-duty scraper conveyor was obtained using the time-varying dynamic ...
Dagang Wang +4 more
doaj +1 more source
Repeated-Root Constacyclic Codes Over the Chain Ring Fpm[u]/⟨u3⟩
IEEE Access, 2020 Let Z = Fpm[u]/(u3) be the finite commutative chain ring, where p is a prime, m is a positive integer and Fpm is the finite field with pm elements. In this paper, we determine all repeated-root constacyclic codes of arbitrary lengths over Z and their ...
Tania Sidana, Anuradha Sharma
doaj +1 more source
$k$th power residue chains of global fields [PDF]
, 2010 In 1974, Vegh proved that if $k$ is a prime and $m$ a positive integer, there is an $m$ term permutation chain of $k$th power residue for infinitely many primes [E.Vegh, $k$th power residue chains, J.Number Theory, 9(1977), 179-181].
Hu, Su, Li, Yan
core +3 more sources
On cyclic codes over finite chain rings
Journal of Physics: Conference Series, 2021 Abstract Recent studies involve various approaches to establish a generating set for cyclic codes of arbitrary length over the class of Galois rings. One such approach involves the use of polynomials with minimal degree corresponding to specific subsets of the code, defined progressively.
null Monika, Sucheta Dutt, Ranjeet Sehmi
openaire +1 more source
Finite Commutative Chain Rings
Finite Fields and Their Applications, 2001 A commutative ring with unit is called a chain ring if all its ideals form a chain under inclusion. All finite chain rings can be obtained in the following way: Let \(p\) be a prime, \(n,r>0\), \(f\in \mathbb{Z}_{p^n}[X]\) a monic polynomial, \(\deg(f)=r\) whose image in \(\mathbb{Z}_p[X]\) is irreducible and let \(\text{GR} (p^n,r): =\mathbb{Z}_{p^n ...
openaire +1 more source
Finitely generated modules and chain rings
Rendiconti del Seminario Matematico della Università di Padova, 2016 This paper investigated finitely generated singular modules over a right chain ring R . We show that these modules behave similar to those over valuation rings provided R
Ulrich Albrecht, Gregg Scible
openaire +1 more source
Enumeration of finite commutative chain rings
Journal of Algebra, 1973 AbstractA chain ring is an associative, commutative ring with an identity whose ideals form a chain. We associate with each finite chain ring five invariants (integers) and determine (in certain cases) the number of isomorphism classes of rings with given invariants.
Clark, W.Edwin, Liang, Joseph J
openaire +1 more source
$G$-codes over formal power series rings and finite chain rings
Journal of Algebra Combinatorics Discrete Structures and Applications, 2020 In this work, we define $G$-codes over the infinite ring $R_\infty$ as ideals in the group ring $R_\infty G$. We show that the dual of a $G$-code is again a $G$-code in this setting. We study the projections and lifts of $G$-codes over the finite chain rings and over the formal power series rings respectively.
Steven T. DOUGHERTY +2 more
openaire +5 more sources
DNA Codes Over the Ring F₄[
IEEE Access, 2020 In this paper, we develop the method for constructing DNA codes of odd length over the finite chain ring $R=\mathbb {F}_{4}[u]/\langle u^{3}\rangle $ , which plays an important role in genetics, bioengineering and DNA computing.
Jie Liu, Hualu Liu
doaj +1 more source
Bounds on Covering Radius of Some Codes Over F₂ + uF₂ + vF₂ + uvF₂
IEEE Access, 2021 Let $R=\mathbb {F}_{2}+u\mathbb {F}_{2}+v\mathbb {F}_{2}+uv\mathbb {F}_{2}$ be a finite non-chain ring, where $u^{2}=u$ , $v^{2}=v$ , $uv=vu$ . We give the lower and upper bounds on the covering radius of different types of repetition codes for ...
Fanghui Ma, Jian Gao
doaj +1 more source