A new genetic decoding of Linear Block Codes

In this paper, we present a new hard-decision decoding technique based on Genetic Algorithms, which is applicable to the more general case where the only known structure is given by the parity-check matrix H. The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We also presented a new soft-decision decoding based on Genetic Algorithms and the Chase algorithm. The simulations applied on some binary Linear Block Codes, show that the genetic decoder has the same performance as the Berlekamp-Massey Algorithm (BM) and Cardoso algorithm.