On the distance optimality of permutation mappings

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

doi:10.1109/ISIT.2005.1523503

On the distance optimality of permutation mappings

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

Electrical and Electronic Engineering Science

University of Johannesburg

Research output: Contribution to journal › Conference article › peer-review

10 Citations (Scopus)

Abstract

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 language	English
Article number	1523503
Journal	IEEE International Symposium on Information Theory - Proceedings
Volume	2005-January
DOIs	https://doi.org/10.1109/ISIT.2005.1523503
Publication status	Published - 2005
Event	2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia Duration: 4 Sept 2005 → 9 Sept 2005

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2005.1523503

Cite this

@article{bfd0d19f4893435395778b62e3754727,

title = "On the distance optimality of permutation mappings",

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

author = "Swart, {Theo G.} and {de Beer}, Ian and Ferreira, {Hendrik C.}",

note = "Publisher Copyright: {\textcopyright} 2005 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.; 2005 IEEE International Symposium on Information Theory, ISIT 05 ; Conference date: 04-09-2005 Through 09-09-2005",

year = "2005",

doi = "10.1109/ISIT.2005.1523503",

language = "English",

volume = "2005-January",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

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

}

TY - JOUR

T1 - On the distance optimality of permutation mappings

AU - Swart, Theo G.

AU - de Beer, Ian

AU - Ferreira, Hendrik C.

PY - 2005

Y1 - 2005

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

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

UR - http://www.scopus.com/inward/record.url?scp=85114353285&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2005.1523503

DO - 10.1109/ISIT.2005.1523503

M3 - Conference article

AN - SCOPUS:85114353285

SN - 2157-8095

VL - 2005-January

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

M1 - 1523503

T2 - 2005 IEEE International Symposium on Information Theory, ISIT 05

Y2 - 4 September 2005 through 9 September 2005

ER -

On the distance optimality of permutation mappings

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this