Solving Maximal Boolean Polynomial Based on Improved Heuristic Algorithm by Using Forward Error Correction Coding

Traditional heuristic algorithms have the disadvantages of being “premature” and always falling into local optimal solutions. Coding theory is a forward error correction technique, and when coding theory is used to solve the problem, the feature of the channel coding technique itself makes the problem be solved. Coding theory is used to solve these problems and improve algorithm performance. Take genetic algorithm as an example, when coding theory is applied to improve heuristic algorithms performance such as genetic algorithms, it can overcome the shortcomings of heuristic algorithms such as “premature”, localization, instability, and greatly increase the certainty and robustness of the algorithm. Improving the heuristic algorithm based on forward error correction coding to solve maximal Boolean polynomial equations not only obtains better results but also the algorithm complexity is low.