arXiv subjects
Publications and source records attributed to I. F. Rúa.
In this work, we present a standard model for Galois rings based on the standard model of their residual fields, that is, a sequence of Galois rings starting with ${\mathbb Z}_{p^r} that coves all the Galois rings with that characteristic ring and such that there is an algorithm producing each member of the sequence whose input is the size of the required ring.
We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study the $\mathcal A-$submodules of $\mathcal A^l$ ($l\in \mathbb{N}$). These codes generalize both the codes over finite quotients of polynomial rings and the multivariable codes over finite chain rings. {Some codes over Frobenius local rings that are not chain rings are also of this type}. A canonical generator matrix for these codes is introduced with the help of the Canonical Generating System. Duality of the codes is also considered.
In this work, we study the structure of multivariable modular codes over finite chain rings when the ambient space is a principal ideal ring. We also provide some applications to additive modular codes over the finite field $\mathbb{F}_4$.
In this paper we deal with the problem of computing the sum of the $k$-th powers of all the elements of the matrix ring $\mathbb{M}_d(R)$ with $d>1$ and $R$ a finite commutative ring. We completely solve the problem in the case $R=\mathbb{Z}/n\mathbb{Z}$ and give some results that compute the value of this sum if $R$ is an arbitrary finite commutative ring $R$ for many values of $k$ and $d$. Finally, based on computational evidence and using some technical results proved in the paper we conjecture that the sum of the $k$-th powers of all the elements of the matrix ring $\mathbb{M}_d(R)$ is always $0$ unless $d=2$, $\textrm{card}(R) \equiv 2 \pmod 4$, $1<k\equiv -1,0,1 \pmod 6$ and the only element $e\in R \setminus \{0\}$ such that $2e =0$ is idempotent, in which case the sum is $\textrm{diag}(e,e)$.
Finite nonassociative division algebras (i.e., finite semifields) with 243 elements are completely classified.
A finite semifield $D$ is a finite nonassociative ring with identity such that the set $D^*=D\setminus\{0\}$ is closed under the product. In this paper we obtain a computer-assisted description of all 64-element finite semifields, which completes the classification of finite semifields of order 125 or less.
A finite semifield is a finite nonassociative ring with identity such that the set of its nonzero elements is closed under the product. From any finite semifield a projective plane can be constructed. In this paper we obtain new semifield planes of orders 81 by means of computational methods. These computer-assisted results yield to a complete classification (up to isotopy) of 81-element finite semifields.