Results 41 to 50 of about 3,045,703 (258)
On the groups of units of finite commutative chain rings
Finite Fields and Their Applications, 2003 A commutative chain ring is a commutative ring whose ideals form a chain under set theoretic inclusion. Let \(M\) be the maximal ideal of a finite commutative chain ring \(R\) with characteristic \(p^n\), then \(R/M\) is a finite field, say \(R/M \cong \text{GF}(p^r)\), and \(pR=M^e\), \(e \leq s\), where \(s\) is the nilpotency of \(M\).
Hou, Xiang-Dong +2 more
openaire +1 more source
Skew Constacyclic Codes over Finite Fields and Finite Chain Rings [PDF]
Mathematical Problems in Engineering, 2016 This paper overviews the study of skewΘ-λ-constacyclic codes over finite fields and finite commutative chain rings. The structure of skewΘ-λ-constacyclic codes and their duals are provided. Among other results, we also consider the Euclidean and Hermitian dual codes of skewΘ-cyclic and skewΘ-negacyclic codes over finite chain rings in general and ...
Dinh, Hai Q. +2 more
openaire +2 more sources
, 2011 In this paper, we present some elementary properties of neutrosophic rings. The structure of neutrosophic polynomial rings is also presented. We provide answers to the questions raised by Vasantha Kandasamy and Florentin Smarandache in [1] concerning ...
Oyebola O.Y. +2 more
core +1 more source
, 2012 This paper is the continuation of the work started in [12]. The present paper is devoted to the study of ideals of neutrosophic rings.
Adeleke E.O +2 more
core +1 more source
Reversible cyclic codes over finite chain rings
CoRR, 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.
Monika Dalal +2 more
openaire +3 more sources
SMARANDACHE NON-ASSOCIATIVE RINGS [PDF]
, 2002 An associative ring is just realized or built using reals or complex; finite or infinite by defining two binary operations on it. But on the contrary when we want to define or study or even introduce a non-associative ring we need two separate algebraic ...
Vasantha, Kandasamy
core +1 more source
On the number of prime order subgroups of finite groups [PDF]
, 2009 Let G be a finite group and let ?(G) be the number of prime order subgroups of G. We determine the groups G with the property ?(G)??G?/2?1, extending earlier work of C. T. C.
Scott, Stuart +3 more
core +1 more source
The weight distribution of codes over finite chain rings
Linear Algebra and its Applications, 2023 In this work, we determine new linear equations for the weight distribution of linear codes over finite chain rings. The identities are determined by counting the number of some special submatrices of the parity-check matrix of the code. Thanks to these relations we are able to compute the full weight distribution of codes with small Singleton defects,
Cavicchioni G., Meneghetti A.
openaire +4 more sources
Characterizations of rings and modules by means of lattices [PDF]
, 1965 PhDIn this thesis we study the relationship between the lattice of submodules and the algebraic structure of a module. The key remark in our study will be the fact that the homomorphisms between two independent submadules of a module can be ...
Stephenson, W.
core +4 more sources
The Depth Distribution of Constacyclic Codes Over
IEEE Access, 2018 The depth distribution of a linear code was put forward by Etzion as a new characterization for linear codes. The previously known results pay close attention to the depth distribution of the linear codes over chain rings.
Guanghui Zhang
doaj +1 more source