Theory and applications of Raptor codes
From MaRDI portal
Publication:4687423
DOI10.1007/978-88-470-1122-9_5zbMath1397.94128OpenAlexW143153632WikidataQ56996367 ScholiaQ56996367MaRDI QIDQ4687423
Publication date: 11 October 2018
Published in: Mathknow (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-88-470-1122-9_5
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Network protocols (68M12) Combinatorial codes (94B25) Decoding (94B35) Source coding (94A29)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Raptor codes on binary memoryless symmetric channels
- Efficient erasure correcting codes
- Improved low-density parity-check codes using irregular graphs
- Efficient encoding of low-density parity-check codes
- Analysis of the Second Moment of the LT Decoder
- Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes