DocumentCode
2715404
Title
Finite-Length Repeat-Accumulate Codes on the Binary Erasure Channel
Author
Johnson, Sarah J.
Author_Institution
Sch. of Electr. Eng. & Comput. Sci., Newcastle Univ., NSW
fYear
2005
fDate
5-5 Oct. 2005
Firstpage
217
Lastpage
221
Abstract
This paper considers the finite-length performance of repeat-accumulate codes on the binary erasure channel. We provide lower bounds for the minimum stopping set size of RA codes and develop finite-length analysis algorithms for them. Using these results the effect of the RA accumulator and the choice of repetition rate on the decoding performance of finite length RA codes is investigated, and their performance compared to that of low-density parity-check codes
Keywords
binary codes; channel coding; decoding; parity check codes; binary erasure channel; decoding; finite-length analysis algorithms; finite-length repeat-accumulate codes; low-density parity-check codes; Algorithm design and analysis; Australia; Computer science; Concatenated codes; Convolutional codes; Decoding; Equations; Interleaved codes; Parity check codes; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2005 Asia-Pacific Conference on
Conference_Location
Perth, WA
Print_ISBN
0-7803-9132-2
Type
conf
DOI
10.1109/APCC.2005.1554051
Filename
1554051
Link To Document