A simple and efficient burst error correcting code based on an array code

Research output: Contribution to conferencePaperpeer-review

Abstract

In this work, we show that a widely used array code, known as the Even-Odd code, which is targeted at phased burst-errors, may also be useful for non-phased burst errors. A new decoder is proposed for this code which effectively converts it into a more general burst-error-correcting code. The proposed scheme is shown to be capable of correcting almost all bursts up to a certain length, such that its performance is attractive for many communication applications. Since the failure rate is sufficiently low, the code can be practically classified as a burst-error-correcting code. The redundancy in this code is equal to twice the maximal burst length, which is the same redundancy as the lower bound of conventional burst error correcting codes (the Reiger bound). Both the encoder and the decoder have very low complexity, both in terms of number of operations and in terms of computer code size. We analyze the probability of failure, provide tight upper and lower bounds, and show that asymptotically this probability is approaching zero for large blocks.

Original languageEnglish
Pages1106-1110
Number of pages5
StatePublished - 2004
EventGLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States
Duration: 29 Nov 20043 Dec 2004

Conference

ConferenceGLOBECOM'04 - IEEE Global Telecommunications Conference
Country/TerritoryUnited States
CityDallas, TX
Period29/11/043/12/04

Fingerprint

Dive into the research topics of 'A simple and efficient burst error correcting code based on an array code'. Together they form a unique fingerprint.

Cite this