New Distance Concept and Graph Theory Approach for Certain Coding Techniques Design and Analysis

A New graph distance concept introduced for certain coding techniques helped in their design and analysis as in the case of distance-preserving mappings and spectral shaping codes. A graph theoretic construction, mapping binary sequences to permutation sequences and inspired from the k-cube graph has reached the upper bound on the sum of the distances for certain values of the length of the permutation sequence. The new introduced distance concept in the k-cube graph helped better understanding and analyzing for the first time the concept of distance-reducing mappings. A combination of distance and the index-permutation graph concepts helped uncover and verify certain properties of spectral null codes, which were previously difficult to analyze.

ON THE ALEKSANDROV–RASSIAS PROBLEM OF DISTANCE PRESERVING MAPPINGS

In this paper, we introduce the concept of a semi-parallelogram and obtain some results for the Aleksandrov–Rassias problem using this concept. In particular, we resolve an important case of this problem for mappings preserving two distances with a nonintegral ratio.