Andrei V. Kelarev, University of Tasmania

ERROR-CORRECTING CODES AS IDEALS IN RING CONSTRUCTIONS

ABSTRACT: Many efficient error-correcting codes are known to be ideals of group rings of Abelian groups. This additional algebraic structure helps to find new codes and to develop faster encoding and decoding algorithms. We will discuss preliminary concepts and recent results obtained on this topic.