Permutation codes over finite fields
arXiv:1904.06820
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.