On the distance optimality of permutation mappings

Theo G. Swart, Ian de Beer, Hendrik C. Ferreira

Research output: Contribution to journalConference articlepeer-review

10 Citations (Scopus)


We investigate the optimal Hamming distance that is achievable when mapping binary sequences to permutation sequences. This is used to determine how close to optimum some of the known mappings are. Furthermore, using simulation results we show that mappings found by exhaustive search using optimum distance as criterion perform better than previous known mappings.

Original languageEnglish
Article number1523503
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 2005
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: 4 Sept 20059 Sept 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics


Dive into the research topics of 'On the distance optimality of permutation mappings'. Together they form a unique fingerprint.

Cite this