Distance-optimality study for permutation codes using cyclic-shift prefix/suffix technique

Khmaies Ouahada; Hendrik C. Ferreira; Ling Cheng

doi:10.1109/AFRCON.2009.5308168

Distance-optimality study for permutation codes using cyclic-shift prefix/suffix technique

Khmaies Ouahada, Hendrik C. Ferreira, Ling Cheng

Electrical and Electronic Engineering Science

University of Johannesburg

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Distance-preserving mappings is a technique that maps binary sequences to permutation sequences. Many mapping algorithms, which are called constructions have been introduced. Few constructions have been considered to be optimum on the sum of distances since they reached the upper bound on the sum of the Hamming distances for certain lengths of the permutation sequence. We introduce a technique based on the cyclic shift of a permutation symbol to understand the conditions that make any construction optimum.

Original language	English
Title of host publication	IEEE Africon 2009
DOIs	https://doi.org/10.1109/AFRCON.2009.5308168
Publication status	Published - 2009
Event	IEEE Africon 2009 - Nairobi, Kenya Duration: 23 Sept 2009 → 25 Sept 2009

Publication series

Name	IEEE AFRICON Conference

Conference

Conference	IEEE Africon 2009
Country/Territory	Kenya
City	Nairobi
Period	23/09/09 → 25/09/09

ASJC Scopus subject areas

Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/AFRCON.2009.5308168

Cite this

@inproceedings{504c18751b624dc4bfd6fafb310d1b0c,

title = "Distance-optimality study for permutation codes using cyclic-shift prefix/suffix technique",

abstract = "Distance-preserving mappings is a technique that maps binary sequences to permutation sequences. Many mapping algorithms, which are called constructions have been introduced. Few constructions have been considered to be optimum on the sum of distances since they reached the upper bound on the sum of the Hamming distances for certain lengths of the permutation sequence. We introduce a technique based on the cyclic shift of a permutation symbol to understand the conditions that make any construction optimum.",

author = "Khmaies Ouahada and Ferreira, {Hendrik C.} and Ling Cheng",

year = "2009",

doi = "10.1109/AFRCON.2009.5308168",

language = "English",

isbn = "9781424439195",

series = "IEEE AFRICON Conference",

booktitle = "IEEE Africon 2009",

note = "IEEE Africon 2009 ; Conference date: 23-09-2009 Through 25-09-2009",

}

TY - GEN

T1 - Distance-optimality study for permutation codes using cyclic-shift prefix/suffix technique

AU - Ouahada, Khmaies

AU - Ferreira, Hendrik C.

AU - Cheng, Ling

PY - 2009

Y1 - 2009

N2 - Distance-preserving mappings is a technique that maps binary sequences to permutation sequences. Many mapping algorithms, which are called constructions have been introduced. Few constructions have been considered to be optimum on the sum of distances since they reached the upper bound on the sum of the Hamming distances for certain lengths of the permutation sequence. We introduce a technique based on the cyclic shift of a permutation symbol to understand the conditions that make any construction optimum.

AB - Distance-preserving mappings is a technique that maps binary sequences to permutation sequences. Many mapping algorithms, which are called constructions have been introduced. Few constructions have been considered to be optimum on the sum of distances since they reached the upper bound on the sum of the Hamming distances for certain lengths of the permutation sequence. We introduce a technique based on the cyclic shift of a permutation symbol to understand the conditions that make any construction optimum.

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

U2 - 10.1109/AFRCON.2009.5308168

DO - 10.1109/AFRCON.2009.5308168

M3 - Conference contribution

AN - SCOPUS:74349093819

SN - 9781424439195

T3 - IEEE AFRICON Conference

BT - IEEE Africon 2009

T2 - IEEE Africon 2009

Y2 - 23 September 2009 through 25 September 2009

ER -

Distance-optimality study for permutation codes using cyclic-shift prefix/suffix technique

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this