Euclidean distance for combinations of some Hamming codes and binary CPFSK modulation (Corresp.)

The integration of channel coding and modulation in a communication system to increase the Euclidean distance between modulated signals is analyzed. Systems using binary continuous-phase frequency-shift keying modulation and some block codes, such as Hamming codes and shortened Hamming codes, are considered. It is shown that the minimum Euclidean distance depends on the configuration of the parity-check matrix
H
of the code. For the examined codes the optimum configurations of
H
, which give the maximum values of the minimum Euclidean distance, are determined.