LDPC code optimization based on Tanner graph mutations
Jan Broulím, Vjačeslav Georgiev, Jan Moldaschl, Lukas Palocko · 2013
The paper presents LDPC error correcting code optimization based on Tanner graph mutations. A statistical experiment focused on a heuristic LDPC code construction was performed with the genetic algorithm. The algorithm used is briefly described. Short wordlength LDPC code optimization was simulated. Results of these simulations are summarized in this paper.