arXiv · 1302.3747
Construction of minimal non-abelian left group codes
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.
Explore related subjects
Keep this discovery
Gabriela Olteanu, Inneke Van Gelder. 2013-02-15. Construction of minimal non-abelian left group codes. https://arxiv.org/abs/1302.3747
Cite the original work for its findings. Save a collection to share your selection of sources.