arXiv Analytics

Sign in

arXiv:1301.6328 [math.GR]AbstractReferencesReviewsResources

Explicit Constructions of Quasi-Uniform Codes from Groups

Eldho K. Thomas, Frederique Oggier

Published 2013-01-27Version 1

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.

Related articles: Most relevant | Search more
arXiv:1509.05706 [math.GR] (Published 2015-09-18)
Explicit constructions of loops with commuting inner mappings
arXiv:2103.10407 [math.GR] (Published 2021-03-18)
Explicit Constructions of Finite Groups as Monodromy Groups
arXiv:2501.18964 [math.GR] (Published 2025-01-31)
The fundamentals of cubical isometry groups