Annotated Raptor Codes

Kaveh Mahdaviani; Masoud Ardakani; Chintha Tellambura

doi:10.1109/ITW.2011.6089435

Annotated Raptor Codes

Information Theory 2016-11-17 v1 math.IT

Authors: Kaveh Mahdaviani , Masoud Ardakani , Chintha Tellambura

View on arXiv ↗ PDF ↗ DOI ↗

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

decoding algorithm source coding coding theory

Cite

@article{arxiv.1110.2343,
  title  = {Annotated Raptor Codes},
  author = {Kaveh Mahdaviani and Masoud Ardakani and Chintha Tellambura},
  journal= {arXiv preprint arXiv:1110.2343},
  year   = {2016}
}

Comments

This paper has been Accepted for presentation in IEEE Information Theory Workshop (ITW) 2011, Paraty, Brazil

Related papers

View all related →