We classify, in terms of the structure finite group G, all algebras KG for which right ideals are annihilators principal left ideals. This means language coding theory that we classify code-checkable have been considered so far only abelian groups G. Optimality checkable codes and asymptotic results discussed.

Let R be a commutative ring with unity, M unitary R-module and G finite abelian group (viewed as \({\mathbb {Z}}\)-module). The main objective of this paper is to study properties mod-annihilators M. For \(x \in M\), we the ideals \([x : M] =\{r\in ~|~ rM\subseteq Rx\}\) corresponding mod-annihilator We investigate when [x an essential ideal R. prove that arbitrary intersection represented by i...

Linearized asymptotic inversion of seismic data maps, given the smooth variations in medium properties such as phase velocities (the background medium), known information on the wavefront set of the data into the unknown singular component of medium variations (the medium contrast). Such inversion was formulated in terms of a Maslov extension of Generalized Radon Transforms, and allows the form...

The incidence matrix between a set of monomials and a set of vectors in IF2 has a great importance in the study of coding theory, cryptography, linear algebra, combinatorics. The rank of these matrices are very useful while computing algebraic immunity(AI) of Boolean functions in cryptography literature [18, 7]. Moreover, these matrices are very sparse and well structured. Thus, for aesthetic r...