Search

In this paper, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi-group codes, that is, as linear codes allowing a group of permutation automorphisms which acts freely on the set of coordinates. An algebraic description, including the concatenated structure, of such codes is presented. This allows to construct quasi-group codes from codes over rings, and vice versa. The last part of the paper is dedicated to the investigation of self-duality of quasi-group codes. [ABSTRACT FROM AUTHOR]

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 group algebras KG which have been considered so far only for abelian groups G. Optimality of checkable codes and asymptotic results are discussed. [ABSTRACT FROM AUTHOR]