Construction of minimal non-abelian left group codes
Representation Theory
2014-01-10 v2 Information Theory
Group Theory
math.IT
Rings and Algebras
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.
Keywords
Cite
@article{arxiv.1302.3747,
title = {Construction of minimal non-abelian left group codes},
author = {Gabriela Olteanu and Inneke Van Gelder},
journal= {arXiv preprint arXiv:1302.3747},
year = {2014}
}