相关论文: Computing the dimension of ideals in group algebra…
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…
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…
An easily computable dimension (or ECD) group code in the group algebra $\mathbb{F}_{q}G$ is an ideal of dimension less than or equal to $p=char(\mathbb{F}_{q})$ that is generated by an idempotent. This paper introduces an easily computable…
Finite semisimple group algebras for which all the minimal ideals are easily computable dimension (ECD) are characterized and some lower bounds for the minimum Hamming distance of group codes in these algebras are offered. Examples…
A dimension group is a partially ordered countable group such that (1) every finite subset is contained in an ordered subgroup which is a finite direct power of Z and (2) the group has an order unit i.e. a positive element u such that every…
We classify, in terms of the structure of the finite group G, all group algebras KG for which all right ideals are right annihilators of principal left ideals. This means in the language of coding theory that we classify code-checkable…
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
We give a simple construction of codes from left ideals in group algebras of certain dihedral groups and give an example to show that they can produce codes with weights equal to those of the best known codes of the same length.
We develop the theory of difference algebraic groups in the case where we have finitely many pairwise commuting difference operators. We show that the defining ideal of a difference algebraic group is finitely generated as a difference…
This paper investigates the application of the theoretical algebraic notion of a separable ring extension, in the realm of cyclic convolutional codes or, more generally, ideal codes. We work under very mild conditions, that cover all…
In this paper, we study the dihedral codes, i.e. the left ideals of $\mathbb{F}_qD_{n}$ in the case $\gcd(q, n) = 1$. An explicit algebraic description of the dihedral codes and their duals is obtained. In addition, a criterion for…
One of the important open problems in the theory of central simple algebras is to compute the essential dimension of $\operatorname{GL}_n/\mu_m$, i.e., the essential dimension of a generic division algebra of degree $n$ and exponent…
We provide an algorithm that, given any order $O$ in a quaternion algebra over a global field, computes representatives of all right equivalence classes of right $O$-ideals, including the non-invertible ones. The theory is developed for a…
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related…
Let $S\subseteq \mathbb N^p$ be a semigroup, any $P\subseteq S$ is an ideal of $S$ if $P+S\subseteq P$, and an $I(S)$-semigroup is the affine semigroup $P\cup \{0\}$, with $P$ an ideal of $S$. We characterise the $I(S)$-semigroups and the…
We classify finite groups $G$, such that the group algebra, $\mathbb{Q}G$ (over the field of rational numbers $\mathbb{Q}$), is the direct product of the group algebra $\mathbb{Q}[G/N]$ of a proper factor group $G/N$, and some division…
Let $\mathbb {F}_q$ be a finite field and $G$ a finte group with $(|G|,q)=1$. By a group code in $\mathbb {F}_q[G]$ we mean a two-sided ideal in $\mathbb {F}_q[G]$. We will prove a general criterion for the existence of group codes with…
We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime…
A group code structure of a linear code is a description of the code as one-sided or two-sided ideal of a group algebra of a finite group. In these realizations, the group algebra is identified with the ambient space, and the group elements…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…