DocumentCode
2452851
Title
Annotated raptor codes
Author
Mahdaviani, Kaveh ; Ardakani, Masoud ; Tellambura, Chintha
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB, Canada
fYear
2011
fDate
16-20 Oct. 2011
Firstpage
272
Lastpage
276
Abstract
In this paper, an extension of raptor codes is introduced which keeps all the desirable properties of raptor codes, including the linear complexity of encoding and decoding per information bit, unchanged. The new design, however, improves the performance in terms of the reception rate. Our simulations show a 10% reduction in the needed overhead at the benchmark block length of 64,520 bits and with the same complexity per information bit.
Keywords
block codes; decoding; linear codes; annotated raptor code; benchmark block length; decoding linear complexity; encoding linear complexity; reception rate; word length 64520 bit; Complexity theory; Decoding; Encoding; Equations; Parity check codes; Probability distribution;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop (ITW), 2011 IEEE
Conference_Location
Paraty
Print_ISBN
978-1-4577-0438-3
Type
conf
DOI
10.1109/ITW.2011.6089435
Filename
6089435
Link To Document