On the computation of the automorphisms group of low density parity check codes using genetic algorithm

<p>The genetic algorithm (GA) is an adaptive metaheuristic search method based on the process of evolution and natural selection theory. It efficient used for solving combinatorial optimization problems, e.g., travel salesman problem (TSP), linear ordering (LOP), job-shop scheduling (JSP). The simple GA applied takes a long time to reach optimal solution, configuration parameters vital successful convergence solutions, it includes population size, crossover operator, mutation operator rates. Also, very recently, many research papers involved in coding theory, In particular, decoding block codes case, which has heavily contributed reducing complexity, guaranting searching fewer iterations. this paper, proposed, computing Automorphisms groups low density parity check (LDPC) codes, results aforementioned show significant efficiency finding important set LDPC codes.</p>