Using graphs for the analysis and construction of permutation distance-preserving mappings

Theo G. Swart, Hendrik C. Ferreira, Khmaies Ouahada

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

A new way of looking at permutation distance-preserving mappings (DPMs) is presented by making use of a graph representation. The properties necessary to make such a graph distance-preserving, are also investigated. Further, this new knowledge is used to analyze previous constructions, as well as to construct a new general mapping algorithm for a previous multilevel construction.

Original languageEnglish
Pages (from-to)910-916
Number of pages7
JournalIEEE Transactions on Information Theory
Volume54
Issue number2
DOIs
Publication statusPublished - Feb 2008

Keywords

  • Code constructions
  • Distance-preserving mappings (DPMs)
  • Graphs
  • Permutation coding

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint

Dive into the research topics of 'Using graphs for the analysis and construction of permutation distance-preserving mappings'. Together they form a unique fingerprint.

Cite this