Dihedral codes with prescribed minimum distance
Information Theory
2020-03-26 v1 Combinatorics
math.IT
Abstract
Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy with the theory of BCH codes. This allows us to construct dihedral codes with prescribed minimum distance. In the binary case, we present some examples of optimal dihedral codes obtained by this construction.
Cite
@article{arxiv.2003.11125,
title = {Dihedral codes with prescribed minimum distance},
author = {Martino Borello and Abdelillah Jamous},
journal= {arXiv preprint arXiv:2003.11125},
year = {2020}
}
Comments
13 pages