{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:53:25Z","timestamp":1780588405582,"version":"3.54.1"},"reference-count":25,"publisher":"Emerald","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,5,18]]},"abstract":"<jats:p>This monograph describes the theory behind Raptor codes, and elucidates elements of the processes behind the design of two of the most prominent members of this class of codes: R10 and RaptorQ (RQ). R10 has already been adopted by a number of standards' bodies, and RQ is in the process of entering various standards at the time of writing of this monograph.<\/jats:p>\n                  <jats:p>The monograph starts with the description of some of the transmission problems, which inspired the invention of Fountain codes. Thereafter, Luby transform codes (LT codes) and Raptor codes are introduced and insights are provided into their design. These codes are currently the most efficient realizations of Fountain codes. Different algorithms are introduced for encoding and decoding various versions of these codes, including their systematic versions. Moreover, a hybrid decoding algorithm called \u201cinactivation decoding\u201d is introduced, which is an integral part of all modern implementations of Raptor codes.<\/jats:p>\n                  <jats:p>The R10 and RQ codes have been continued and will continue to be adopted into a number of standards and thus there are publicly available specifications that describe exactly how to implement these codes. However, the standards' specifications provide no insight into the rationale for the design choices made. One of the primary purposes of this document is to provide this design rationale.<\/jats:p>\n                  <jats:p>We provide results of extensive simulations of R10 and RQ codes to show the behavior of these codes in many different scenarios.<\/jats:p>","DOI":"10.1561\/0100000060","type":"journal-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T06:29:11Z","timestamp":1305613751000},"page":"213-322","source":"Crossref","is-referenced-by-count":121,"title":["Raptor Codes"],"prefix":"10.1108","volume":"6","author":[{"given":"Amin","family":"Shokrollahi","sequence":"first","affiliation":[{"name":"EPFL , Station 14, Lausanne 1015,","place":["Switzerland"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Luby","sequence":"additional","affiliation":[{"name":"Qualcomm, Inc. , 3195 Kifer Road, Santa Clara, CA 95051,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2011,5,18]]},"reference":[{"key":"2026032712073122200_ref001","volume-title":"Technical Specification Group Services and System Aspects; Multimedia Broadcast\/Multicast Service; Protocols and Codecs","author":"3GPP TS 26.346 V6.1.0","year":"2005"},{"issue":"9","key":"2026032712073122200_ref002","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/360336.360343","article-title":"Efficient generation of the binary reflected Gray code and its applications","volume":"19","author":"Bitner","year":"1976","journal-title":"Communications of the ACM"},{"key":"2026032712073122200_ref003","article-title":"A digital fountain approach to reliable distribution of bulk data","volume":"98","author":"Byers","year":"1998","journal-title":"Proceedings of ACM SIGCOMM"},{"key":"2026032712073122200_ref004","unstructured":"DARPA Internet Program, \u201cInternet protocol,\u201d\n          \n          September\n          1981, Internet Engineering Task Force, RFC 791. Available at http:\/\/www.ietf.org\/rfc\/rfc0793.txt?number=791."},{"key":"2026032712073122200_ref005","unstructured":"DARPA Internet Program, \u201cTransmission control protocol,\u201d\n          September\n          1981, Internet Engineering Task Force, RFC 793. Available at http:\/\/www.ietf.org\/rfc\/rfc0793.txt?number=793."},{"key":"2026032712073122200_ref006","unstructured":"ETSI TS 102 472 v1.2.1\n          , \u201cIP Datacast over DVB-H: Content Delivery Protocols,\u201d March2006, Technical Specification. Available at http:\/\/www.dvb-h.org."},{"key":"2026032712073122200_ref007","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low Density Parity-Check Codes","author":"Gallager","year":"1963"},{"key":"2026032712073122200_ref008","first-page":"109","volume":"90","author":"Lamacchia","year":"1991","journal-title":"Solving large sparse linear systems over finite fields,\u201d in Proceedings CRYPTO\u2019"},{"key":"2026032712073122200_ref009","first-page":"271","article-title":"\u201cLT-codes","author":"Luby","year":"2002"},{"key":"2026032712073122200_ref010","doi-asserted-by":"crossref","unstructured":"M.\n              Luby\n             and V.Goyal, \u201cWave and equation based rate control,\u201d April 2004, Internet Engineering Task Force, RFC 3738. Available at http:\/\/tools.ietf.org\/html\/rfc3738.","DOI":"10.17487\/rfc3738"},{"key":"2026032712073122200_ref011","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/633025.633044","article-title":"\u201cWave and equation based rate control,\u201d","volume-title":"Proceedings of SIGCOMM","author":"Luby","year":"2002"},{"key":"2026032712073122200_ref012","first-page":"364","article-title":"Analysis of random processes via and-or tree evaluation","author":"Luby","year":"1998"},{"key":"2026032712073122200_ref013","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/18.910575","article-title":"Efficient erasure correcting codes","volume":"47","author":"Luby","year":"2001","journal-title":"IEEE Transactions Information Theory"},{"key":"2026032712073122200_ref014","first-page":"150","article-title":"\u201cPractical loss-resilient codes,\u201d","volume-title":"Proceedings of the 29th Annual ACM Symposium on Theory of Computing","author":"Luby","year":"1997"},{"key":"2026032712073122200_ref015","doi-asserted-by":"crossref","unstructured":"M.\n              Luby\n            , A.Shokrollahi, M.Watson, and T.Stockhammer, \u201cRaptor forward error correction scheme for object delivery,\u201dSeptember2007, Internet Engineering Task Force, RFC 5053. Available at http:\/\/tools.ietf.org\/html\/rfc5053.","DOI":"10.17487\/rfc5053"},{"key":"2026032712073122200_ref016","doi-asserted-by":"crossref","unstructured":"M.\n              Luby\n            , A.Shokrollahi, M.Watson, T.Stockhammer, and L.Minder, \u201cRaptorQ forward error correction scheme for object delivery,\u201dAugust2010, Internet Engineering Task Force. Available at http:\/\/tools.ietf.org\/html\/draft-ietf-rmt-bb-fec-raptorq-03.","DOI":"10.17487\/rfc6330"},{"key":"2026032712073122200_ref017","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1080\/10586458.1992.10504250","article-title":"\u201cReduction of huge, sparse matrices over finite fields via created catastrophes,\u201d","volume":"1","author":"Pomerance","year":"1992","journal-title":"Experimental Math"},{"key":"2026032712073122200_ref018","unstructured":"J.\n              Postel\n            \n          , \u201cUser datagram protocol,\u201dAugust1980,Internet Engineering Task Force, RFC 768. Available at http:\/\/www.ietf.org\/rfc\/rfc0768.txt?number=768."},{"key":"2026032712073122200_ref019","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1109\/18.910579","article-title":"\u201cEfficient encoding of low-density parity-check codes,\u201d","volume":"47","author":"Richardson","year":"2001","journal-title":"IEEE Transactions Information Theory"},{"issue":"6","key":"2026032712073122200_ref020","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","article-title":"\u201cRaptor codes,\u201d","volume":"52","author":"Shokrollahi","year":"2006","journal-title":"IEEE Transactions Information Theory"},{"key":"2026032712073122200_ref021","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-88-470-1122-9_5","article-title":"\u201cTheory and applications of raptor codes,\u201d","volume-title":"Proceedings of MathKnow","author":"Shokrollahi","year":"2009"},{"key":"2026032712073122200_ref022","article-title":"\u201cSystems and processes for decoding chain reaction codes through inactivation,\u201d","volume-title":"U.S. Patent number 6,856,263","author":"Shokrollahi","year":"2005"},{"key":"2026032712073122200_ref023","article-title":"\u201cMulti-stage code generator and decoder for communication systems,\u201d","volume-title":"U.S. Patent 7,068,729","author":"Shokrollahi","year":"2006"},{"key":"2026032712073122200_ref024","article-title":"\u201cSystematic encoding and decoding of chain reaction codes,\u201d","volume-title":"U.S. Patent 6 909 383","author":"Shokrollahi","year":"2005"},{"key":"2026032712073122200_ref025","article-title":"\u201cDecoding complexity of low-density codes for transmission in a channel with erasures,\u201d","volume":"10","author":"Zyablov","year":"1974","journal-title":"Probl. Information Transmission"}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/6\/3-4\/213\/10912064\/0100000060en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/6\/3-4\/213\/10912064\/0100000060en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:10:46Z","timestamp":1777471846000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/6\/3-4\/213\/1321544\/Raptor-Codes"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,18]]},"references-count":25,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2011,5,18]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000060","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,18]]}}}