Abstract
D.Ing.
In this thesis we combined two techniques, namely a spectral shaping technique and a
distance-preserving mapping technique to design new codes with both special spectrum shaping and error correction capabilities, in order to overcome certain communication problems like those that occur in a power-line communication channel.
A new distance-preserving mapping construction based on graph theory is firstly presented. The k-cube graph construction from binary sequences to permutation sequences reached the upper bound on the sum of the Hamming distances for certain lengths of the permutation sequences and achieves the same sum of the Hamming distances as the best previously published constructions for most of the rest of the lengths. The k-cube graph construction is considered to be a simple and easy construction to understand the concept of mappings and especially the concept of a distance-reducing mapping.