Minimal group codes over alternating groups

Abstract

In this work we show that every minimal code in a semisimple group algebra FqG is essential if G is a simple group. Since the alternating group An is simple if n=3 or n≥ 5, we present some examples of minimal codes in FqAn. For this purpose, if char(Fq)> n, we present the Wedderburn-Artin decomposition of FqSn and FqAn and explicit some of the centrally primitive idempotents of FqSn and FqAn.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…