TY - GEN
T1 - A k-cube graph construction for mappings from binary vectors to permutations
AU - Ouahada, Khmaies
AU - Ferreira, Hendrik C.
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=70449473628&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2009.5205703
DO - 10.1109/ISIT.2009.5205703
M3 - Conference contribution
AN - SCOPUS:70449473628
SN - 9781424443130
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 630
EP - 634
BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009
T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009
Y2 - 28 June 2009 through 3 July 2009
ER -