The introduction of the concept of sequential decoding by Wozencraft has opened up the possibility of more efficient decoding search procedures than those available with block code.. The purpose of this study is to try to improve the decoding scheme proposed by Pfeiffer and Lin. Because of the group property of the code, we do not have to search every branch when the tentatively decoding path has violated the threshold function. If the errors occur at 2nd, 3rd branches, we connect the 1st and 4th branches. By jumping over the errors, a correct path can be obtained. This article describes the use of the jumping method, according to the group property of the code word, in order to minimize the decoding operation.