Permutation codes over finite fields
classification
💻 cs.IT
math.ITmath.RA
keywords
codespermutationclassdescribebinarycalledcyclicexamples
read the original 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 $5$-ary. Then, we describe its structure as submodules over a polynomial ring.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.