Permutation codes over finite fields
From MaRDI portal
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.
This page was built for publication: Permutation codes over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6317184)
