A k-cube graph construction for mappings from binary vectors to permutations

Authors:
Khmaies Ouahada;Hendrik C. Ferreira
Affiliations:
Department of Electrical and Electronic Engineering Science, University of Johannesburg, Auckland Park, South Africa;Department of Electrical and Electronic Engineering Science, University of Johannesburg, Auckland Park, South Africa
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 8
Cited 1

Express Cubes: Improving the Performance of k-ary n-cube Interconnection Networks

IEEE Transactions on Computers
Principles of Digital Communication and Coding

Principles of Digital Communication and Coding
Embedding Binary Trees into Crossed Cubes

IEEE Transactions on Computers
Fibonacci Cubes-A New Interconnection Topology

IEEE Transactions on Parallel and Distributed Systems
Graph Theory and Its Applications, Second Edition (Discrete Mathematics and Its Applications)

Graph Theory and Its Applications, Second Edition (Discrete Mathematics and Its Applications)
Distance-preserving mappings from binary vectors to permutations

IEEE Transactions on Information Theory
Distance-increasing mappings from binary vectors to permutations

IEEE Transactions on Information Theory
A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings

IEEE Transactions on Information Theory

Permutation sequences and coded PAM signals with spectral nulls at rational submultiples of the symbol frequency

Cryptography and Communications

Quantified Score

Hi-index	0.02

Visualization

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.