Permutation codes over finite fields

04/15/2019

∙

by   Irwansyah, et al.

∙

0

∙

share

In this paper we describe a class of codes called 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 5-ary. Then, we describe its structure as submodules over a polynomial ring.