The effective method of improving Berlekamp-Preparata convolutional codes decoding by tail-biting technology

An application of convolutional codes is the burst error correcting, and the terminated Berlekamp-Preparata convolutional codes are the suboptimal phased burst error correcting codes. This paper presents a decoding method of tail-biting Berlekamp-Preparata convolutional codes that based on tail-biting technology, which can correct the final m block errors without m block termination check data within correcting capability of the codes. From the results of this study, it is confirmed that the rates of tail-biting Berlekamp-Preparata convolutional codes given by the proposed decoding method are improved to R= (n-1)/n, while the rates of terminated Berlekamp-Preparata convolutional codes based on the original decoding method are R = (n-1) h/n (h + m). As a conclusion, this study reveals that the tail-biting Berlekamp-Preparata convolutional codes are the optimal phased burst error correcting codes.