<?xml version="1.0" encoding="UTF-8"?>
<record>
  <title>Deterministic Algorithms for Solving Coding Theory Issues</title>
  <journal>Progress in Machines and Systems</journal>
  <author>Stojanche Panov1 and Saso Koceski2</author>
  <volume>11</volume>
  <issue>2</issue>
  <year>2022</year>
  <doi>https://doi.org/10.6025/pms/2022/11/2/27-33</doi>
  <url>https://www.dline.info/pms/fulltext/v11n2/pmsv11n2_1.pdf</url>
  <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.</abstract>
</record>
