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 language | English |
---|---|
Pages (from-to) | 910-916 |
Number of pages | 7 |
Journal | IEEE Transactions on Information Theory |
Volume | 54 |
Issue number | 2 |
DOIs | |
Publication status | Published - 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