The Construction of Permutation Group Codes for Communication Systems: Prime or Prime Power?
This paper focuses on correcting a theorem relating to the construction of permutation group codes (PGCs). The theorem in question assumed that affine transformation could be used to enumerate all the code words of a permutation array with a minimum Hamming distance (MHD) of n - 1 for any n >...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9064882/ |