source: arXiv (Cornell University)
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.
Concepts :
Coding theory and cryptography
Error Correcting Code Techniques
graph theory and CDMA systems
preprint
cite 0
Year 2019
source arXiv (Cornell University)
Citations by Year
| Year | Count |
|---|---|
| 2019 | 0 |