Related papers: Ideal codes over separable ring extensions
We construct a commutative version of the group ring and show that it allows one to translate questions about the normal generation of groups into questions about the generation of ideals in commutative rings. We demonstrate this with an…
Several relations and bounds for the dimension of principal ideals in group algebras are determined by analyzing minimal polynomials of regular representations. These results are used in the two last sections. First, in the context of…
We make a detailed study of idempotent ideals that are traces of countably generated projective right modules. We associate to such ideals an ascending chain of finitely generated left ideals and, dually, a descending chain of cofinitely…
In this paper we investigate codes over finite commutative rings R, whose generator matrices are built from \$\alpha\$-circulant matrices. For a non-trivial ideal I<R we give a method to lift such codes over R/I to codes over R, such that…
The ring of periodic distributions on ${\mathbb{R}}^{\tt d}$ with usual addition and with convolution is considered. Via Fourier series expansions, this ring is isomorphic to the ring ${\mathcal{S}}'({\mathbb{Z}}^{\tt d})$ of all maps…
The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…
We show that ideal submodules and closed ternary ideals in Hilbert modules are the same. We use this insight as a little peg on which to hang a little note about interrelations with other notions regarding Hilbert modules. In Section 3, we…
In the last 60 years coding theory has been studied a lot over finite fields $\mathbb{F}_q$ or commutative rings $\mathcal{R}$ with unity. Although in $1993$, a study on the classification of the rings (not necessarily commutative or ring…
This paper investigates ideal-theoretic as well as homological extensions of the Prufer domain concept to commutative rings with zero divisors in an amalgamated duplication of a ring along an ideal. The new results both compare and contrast…
For nonzero coprime integers $a$ and $b$, a positive integer $\ell$ is said to be \emph{good with respect to $a$ and $b$} if there exists a positive integer $k$ such that $\ell$ divides $a^{k} + b^{k}$. The concept of good integers has been…
When studying local properties of a polynomial ideal, one usually needs a theoretic technique called localization. For most cases, in spite of its importance, the computation in a localized ring cannot be algorithmically preformed. On the…
An ideal is a classical object of study in the field of algebraic number theory. In maximal quadratic orders of number fields, ideals usually represented by the $\mathbb Z$-basis. This form of representation is used in most of the…
We study evolution algebras of arbitrary dimension. We analyze in deep the notions of evolution subalgebras, ideals and non-degeneracy and describe the ideals generated by one element and characterize the simple evolution algebras. We also…
It is shown that there is a close relationship between ideal extensions of rings and trusses, that is, sets with a semigroup operation distributing over a ternary abelian heap operation. Specifically, a truss can be associated to every…
In this work, we study codes generated by elements that come from group matrix rings. We present a matrix construction which we use to generate codes in two different ambient spaces: the matrix ring $M_k(R)$ and the ring $R,$ where $R$ is…
A general method for constructing convolutional codes from units in Laurent series over matrix rings is presented. Using group ring as matrix rings, this forms a basis for in-depth exploration of convolutional codes from group ring…
The "neural code" is the way the brain characterizes, stores, and processes information. Unraveling the neural code is a key goal of mathematical neuroscience. Topology, coding theory, and, recently, commutative algebra are some the…
Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…
Convolutional codes are constructed, designed and analysed using row and/or block structures of unit algebraic schemes. Infinite series of such codes and of codes with specific properties are derived. Properties are shown algebraically and…
For the category of group codes, that generalizes the category of linear codes over a finite field, and with the generalized notions of direct sums and ndecomposable group codes, we prove that every MDS non trivial code, every perfect non…