Using Graphs for the Analysis and Construction of Permutation Distance-Preserving Mappings

DOI10.1109/TIT.2007.913268MaRDI QIDQ3604519zbMATH OpenOpenAlexFDO

Authors Theo G. Swart, Hendrik C. Ferreira, Khmaies Ouahada

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2007.913268

Mathematics Subject Classification ID

Distance in graphs (05C12) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Combinatorial codes (94B25)

Recommendations

• Distance preserving mappings of Grassmann graphs
• Distance Labeling for Permutation Graphs
• Distance-preserving mappings from binary vectors to permutations
• Distance and connectivity measures in permutation graphs
• Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
• On metric dimension of permutation graphs
• Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
• Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations
• Simple Distance-Preserving Mappings From Ternary Vectors to Permutations
• Adjacency preserving mappings

Cited in

(1)

• Quantization of high dimensional Gaussian vector using permutation modulation with application to information reconciliation in continuous variable QKD

This page was built for publication: Using Graphs for the Analysis and Construction of Permutation Distance-Preserving Mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604519)