2000 character limit reached
Construction of minimal non-abelian left group codes
Published 15 Feb 2013 in math.RT, cs.IT, math.GR, math.IT, and math.RA | (1302.3747v2)
Abstract: Algorithms to construct minimal left group codes are provided. These are based on results describing a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple finite group algebra FG for a large class of groups G. As an illustration of our methods, alternative constructions to some best linear codes over F_2 and F_3 are given.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
