LT and Raptor Codes

K. Deergha Rao ()
Additional contact information
K. Deergha Rao: Osmania University, Research and Training Unit for Navigational Electronics, College of Engineering

Chapter Chapter 9 in Channel Coding Techniques for Wireless Communications, 2015, pp 305-323 from Springer

Abstract: Abstract To partially compensate the inefficiency of random codes, we can use Reed–Solomon codes, these codes can be decoded from a block with the maximum possible number of erasures in time quadratic in the dimension. But in practice, these algorithms are often too complicated and quadratic running times are still too large for many applications. Hence, a new class of codes is needed to construct robust and reliable transmission schemes and such a class of codes is known as fountain codes.

Keywords: Degree Distribution; Parity Check Matrix; Input Symbol; Output Symbol; Source Symbol (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-81-322-2292-7_9

Ordering information: This item can be ordered from
http://www.springer.com/9788132222927

DOI: 10.1007/978-81-322-2292-7_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().