Unlike the genetic decoding algorithms of Maini et al and the DDGA algorithm, we propose in this paper, a new genetic algorithm which uses the available encoding procedure and without necessity to pass to any equivalent code.
Contrary to the Maini and DDGA algorithms, the AutDAG algorithm doesn't contains any instruction requiring the property of code linearity.
The figure 13 presents a comparison between the error correcting performances of AutDAG and those of the Maini and DDGA Algorithms applied to the QR (71, 36) and QR(31,16) codes by using the simulation parameters given in the table 2.
The AutDAG algorithm has the same memory complexity comparing to the Maini and DDGA algorithms.
The AutDAG algorithm benefit from the simplicity of polynomial encoding, contrary to the DDGA, Maini and OSD decoders which require using the generator matrix for encoding even if the code is cyclic.
It gives also the complexities of Maini algorithm, OSD, Chase-2, SDGA, Chana algorithm, DDGA, PGAD.
Comparing to the Maini decoder, the DDGA algorithm reduces the complexity of decoding the codes of high rates.