Tail-Biting Berlekamp-Preparata Convolutional Codes for Phased-Burst-Error-Correcting

Tianyi ZHANG  Masato KITAKAMI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E103-A   No.3   pp.605-612
Publication Date: 2020/03/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.2019EAP1093
Type of Manuscript: PAPER
Category: Information Theory
Keyword: 
tail-biting convolutional codes,  burst-error-correcting codes,  memory channel,  

Full Text: PDF(745KB)>>
Buy this Article




Summary: 
This paper presents new encoding and decoding methods for Berlekamp-Preparata convolutional codes (BPCCs) based on tail-biting technique. The proposed scheme can correct a single block of n bit errors relative to a guard space of m error-free blocks while no fractional rate loss is incurred. The proposed tail-biting BPCCs (TBBPCCs) can attain optimal complete burst error correction bound. Therefore, they have the optimal phased-burst-error-correcting capability for convolutional codes. Compared with the previous scheme, the proposed scheme can also improve error correcting capability.