Based on h reference words, Kasami et. al. proposed an integer programming problem (IPP) whose optimal value of the objective function gives a sufficient condition on the optimality of a decoded codeword. The IPP has been solved for 1 <= h <= 3. In this paper, an algorithm for solving the IPP for h = 4 is presented. The computational complexity of this algorithm is investigated.
展开▼
机译：Kasami等人基于h个参考词。 al。提出了一种整数规划问题（IPP），其目标函数的最优值为解码码字的最优性提供了充分的条件。 IPP已求解1 <= h <=3。在本文中，提出了一种求解h = 4的IPP的算法。研究了该算法的计算复杂度。
展开▼
