Abstract
This paper presents a comparative study on the distance optimality for Distance-Preserving Mappings codes generated from different constructions. Few constructions are considered to investigate the reasons behind making codes optimum when they reach the upper bound on the sum of the Hamming distances for certain lengths of the permutation sequences. The technique of cyclic-shift prefix or suffix of permutation symbols is used to investigate the conditions making distance-preserving mappings codes optimum.
Original language | English |
---|---|
Pages (from-to) | 155-164 |
Number of pages | 10 |
Journal | Transactions of the South African Institute of Electrical Engineers |
Volume | 103 |
Issue number | 4 |
DOIs | |
Publication status | Published - Dec 2012 |
Keywords
- Cyclic codes
- Distance optimality
- Distance-preserving mappings
- Suffix/prefix
ASJC Scopus subject areas
- Electrical and Electronic Engineering