New decoding methods of interleaved burst error‐correcting codes

Abstract

AbstractThis paper proposes new methods of burst error correction for block interleaved error‐correcting codes. First, a probabilistic method of a single burst error correction, using syndrome correlation of subcodes which constitute the interleaved code, is presented. With this method, the high capability of correcting burst errors potentially owned by the interleaved codes is realized with less decoding delay. Second, by generalizing the above method, a probabilistic method of multiple (m‐fold) burst error correction is presented. With this method, after estimating the burst error positions using syndrome correlation of subcodes which are interleaved m‐fold burst error detecting codes, erasure errors are corrected in each subcode and m‐fold burst errors are corrected successfully. the code constructed by interleaving m‐fold burst error‐detecting codes is shown to be superior to the Reed‐Solomon code for 2‐fold burst error correction with respect to both error correction capability and decoding delay. the performances of these methods (single burst error correction method and multiple burst error correction method) are analyzed by computer simulation and their effectiveness is clarified.