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

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

doi:10.1109/TIT.2007.913268

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

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

Electrical and Electronic Engineering Science

University of Johannesburg

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	910-916
Number of pages	7
Journal	IEEE Transactions on Information Theory
Volume	54
Issue number	2
DOIs	https://doi.org/10.1109/TIT.2007.913268
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

Access to Document

10.1109/TIT.2007.913268

Cite this

@article{929637fc741843eaab6d7588927de89a,

title = "Using graphs for the analysis and construction of permutation distance-preserving mappings",

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.",

keywords = "Code constructions, Distance-preserving mappings (DPMs), Graphs, Permutation coding",

author = "Swart, \{Theo G.\} and Ferreira, \{Hendrik C.\} and Khmaies Ouahada",

year = "2008",

month = feb,

doi = "10.1109/TIT.2007.913268",

language = "English",

volume = "54",

pages = "910--916",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "2",

}

TY - JOUR

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

AU - Swart, Theo G.

AU - Ferreira, Hendrik C.

AU - Ouahada, Khmaies

PY - 2008/2

Y1 - 2008/2

N2 - 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.

AB - 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.

KW - Code constructions

KW - Distance-preserving mappings (DPMs)

KW - Graphs

KW - Permutation coding

UR - https://www.scopus.com/pages/publications/39849095712

U2 - 10.1109/TIT.2007.913268

DO - 10.1109/TIT.2007.913268

M3 - Article

AN - SCOPUS:39849095712

SN - 0018-9448

VL - 54

SP - 910

EP - 916

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 2

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this