Related papers: Ideal codes over separable ring extensions
Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be translated into the setting of code ideals. It will be shown…
Given a unital associative ring S and a subring R, we say that S is an ideal (or Dorroh) extension of R if for some ideal I of S, S = R + I, where the sum is direct. In this note we investigate the ideal structure of an arbitrary ideal…
Based upon properties of ordinal length, we introduce a new class of modules, the binary modules, and study their endomorphism ring. The nilpotent endomorphisms form a two-sided ideal, and after factoring this out, we get a commutative…
An ideal on a set $X$ is a collection of subsets of $X$ closed under the operations of taking finite unions and subsets of its elements. Ideals are a very useful notion in topology and set theory and have been studied for a long time. We…
In this paper we give the structure of constacyclic codes over formal power series and chain rings. We also present necessary and sufficient conditions on the existence of MDS codes over principal ideal rings. These results allow for the…
We study codes with a single check element derived from group rings, namely, checkable codes. The notion of a code-checkable group ring is introduced. Necessary and sufficient conditions for a group ring to be code-checkable are given in…
For a commutative ring R we investigate the property that the sets of minimal primes of finitely generated ideals of R is always finite. We prove this property passes to polynomial ring extensions (in an arbitrary number of variables) over…
In this paper, we investigate the algebraic properties of the expectation semirings which are semiring version of the concept of trivial extension in ring theory. We discuss ideals, primes, maximals and primary ideals of these semirings. We…
Irreducible decompositions of monomial ideals in polynomial rings over a field are well-understood. In this paper, we investigate decompositions in the set of monomial ideals in the semigroup ring A[\mathbb{R}_{\geq 0}^d] where A is an…
It is known that, for transmission over quasi-static MIMO fading channels with n transmit antennas, diversity can be obtained by using an inner fully diverse space-time block code while coding gain, derived from the determinant criterion,…
It is well-known that each left ideals in a matrix rings over a finite field is generated by an idempotent matrix. In this work we compute the number of left ideals in these rings, the number of different idempotents generating each left…
The existence of ideal objects, such as maximal ideals in nonzero rings, plays a crucial role in commutative algebra. These are typically justified using Zorn's lemma, and thus pose a challenge from a computational point of view. Giving a…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
Group codes are right or left ideals in a group algebra of a finite group over a finite field. Following ideas of Bazzi and Mitter on group codes over the binary field, we prove that group codes over finite fields of any characteristic are…
This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…
In this work, cyclic-skew-cyclic codes and sum-rank BCH codes are introduced. Cyclic-skew-cyclic codes are characterized as left ideals of a suitable non-commutative finite ring, constructed using skew polynomials on top of polynomials (or…
Neural codes form an algebraic framework to study the nervous system, and understanding neural codes is a key goal of mathematical neuroscience. Neural rings and ideals are the tools connecting neuroscience and commutative algebra. In this…
Reduced ideals have been defined in the context of integer rings in quadratic number fields, and they are closely tied to the continued fraction algorithm. The notion of this type of ideal extends naturally to number fields of higher…
An ideal in a polynomial ring encodes a system of linear partial differential equations with constant coefficients. Primary decomposition organizes the solutions to the PDE. This paper develops a novel structure theory for primary ideals in…
In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters…