Universal burst error correction

被引：22

作者：

Fossorier, Marc ^{[1
]}

机构：

[1] Univ Hawaii, Dept Elect Engn, Honolulu, HI 96822 USA

来源：

2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS | 2006年

关键词：

D O I：

10.1109/ISIT.2006.261893

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

In this paper, it is shown that under very mild assumptions, practically any binary linear block code of length N and dimension K is able to correct any burst of length up to N - K with probability of success P-c = 1 for erasures, and any burst of length up to N - K - m with probability of success P-c >= 1 - N2(-m) for errors. In both cases, the decoding is based on identifying a string of zeroes in an extended syndrome corresponding to a particular representation of the parity check matrix of the code and its complexity is O(N-2) binary operations.

引用

页码：1969 / 1973

页数：5