Explicit Constructions of Quasi-Uniform Codes from Groups
Group Theory
2013-01-29 v1 Information Theory
math.IT
Abstract
We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian groups. Potentials applications comprise the design of almost affine codes and non-linear network codes.
Keywords
Cite
@article{arxiv.1301.6328,
title = {Explicit Constructions of Quasi-Uniform Codes from Groups},
author = {Eldho K. Thomas and Frederique Oggier},
journal= {arXiv preprint arXiv:1301.6328},
year = {2013}
}