Design and analysis of codes with distance 4 and 6 minimizing the probability of decoder error

The problem of minimization of the decoder error probability is considered for shortened codes of dimension 2 m with distance 4 and 6. We prove that shortened Panchenko codes with distance 4 achieve the minimal probability of decoder error under special form of shortening. This shows that Hamming co...

Ausführliche Beschreibung