Permutation codes over finite fields
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.