Permutation codes over finite fields
Information Theory
2019-04-16 v1 math.IT
Rings and Algebras
Abstract
In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and -ary. Then, we describe its structure as submodules over a polynomial ring.
Keywords
Cite
@article{arxiv.1904.06820,
title = {Permutation codes over finite fields},
author = {Irwansyah and Intan Muchtadi-Alamsyah and Aleams Barra},
journal= {arXiv preprint arXiv:1904.06820},
year = {2019}
}