DocumentCode
2285753
Title
A simple and efficient burst error correcting code based on an array code
Author
Raphaeli, Dan
Author_Institution
Electr. Eng. -Syst. Dept., Tel Aviv Univ., Israel
Volume
2
fYear
2004
fDate
29 Nov.-3 Dec. 2004
Firstpage
1106
Abstract
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 approaches zero for large blocks.
Keywords
computational complexity; decoding; error correction codes; probability; Reiger bound; array code; burst error correcting code; complexity; decoder; even-odd code; maximal burst length; nonphased burst errors; phased burst errors; redundancy; Application software; Communication systems; Data engineering; Decoding; Error analysis; Error correction codes; Failure analysis; Fires; Phased arrays; Redundancy;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE
Print_ISBN
0-7803-8794-5
Type
conf
DOI
10.1109/GLOCOM.2004.1378129
Filename
1378129
Link To Document