Title :
A k-cube graph construction for mappings from Binary vectors to permutations
Author :
Ouahada, Khmaies ; Ferreira, Hendrik C.
Author_Institution :
Dept. of Electr. & Electron. Eng. Sci., Univ. of Johannesburg, Johannesburg, South Africa
fDate :
June 28 2009-July 3 2009
Abstract :
A new graph theoretic construction mapping binary sequences to permutation sequences is presented. The k-cube graph construction has reached the upper bound on the sum of the distances for certain values of the length of the permutation sequence. This contributed in a better way to understand the distance-reducing mapping, which was not investigated before.
Keywords :
binary sequences; graph theory; vectors; binary sequences; binary vectors; distance-reducing mapping; graph theory; k-cube graph construction; permutation sequences; Africa; Application software; Binary sequences; Computer networks; Concurrent computing; Convolutional codes; Delay; Hamming distance; Network topology; Upper bound;
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
DOI :
10.1109/ISIT.2009.5205703
