Deterministic Algorithms for Solving Coding Theory Issues
Stojanche Panov1 and Saso Koceski2
Progress in Machines and Systems, Vol. 11, No. 2, 2022.
DOI: https://doi.org/10.6025/pms/2022/11/2/27-33
Link: https://www.dline.info/pms/fulltext/v11n2/pmsv11n2_1.pdf
Abstract:
Using the reducing domain algorithms, we have studied the differences and issues in the available approaches to solve puzzles and have come out with a new deterministic approach for arriving at good solutions. Whereas other algorithms are available, we in this paper have provided a new kind of solution to this problem and found more acceptable results. We are confident that to solve the coding theory issues, this kind of development of effective deterministic algorithms.