|
Low-density parity-check codes were rst introduced by Gallager [1]. In [2] asymptotical properties of low-density codes based on Hamming codes were investigated. The simulation results of the soft decision decoding of these codes were given in [3]. It has been also proven there that the minimum distance of such codes grows linearly with the code length. In this paper we study similar codes based on extended Hamming codes.
|
||||||
|
||||||
|
||||||
