Fountain codes Export

@article{Mackay-2005-Fountain, abstract = {Fountain codes are record-breaking sparse-graph codes for channels with erasures, such as the internet, where files are transmitted in multiple small packets, each of which is either received without error or not received. Standard file transfer protocols simply chop a file up into K packet-sized pieces, then repeatedly transmit each packet until it is successfully received. A back channel is required for the transmitter to find out which packets need retransmitting. In contrast, fountain codes make packets that are random functions of the whole file. The transmitter sprays packets at the receiver without any knowledge of which packets are received. Once the receiver has received any N packets, where N is just slightly greater than the original file size K, the whole file can be recovered. In the paper random linear fountain codes, LT codes, and raptor codes are reviewed. The computational costs of the best fountain codes are astonishingly small, scaling linearly with the file size.}, author = {Mackay, D. J. C.}, booktitle = {Communications, IEE Proceedings-}, citeulike-article-id = {1983159}, citeulike-linkout-0 = {http://dx.doi.org/10.1049/ip-com:20050237}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1561992}, doi = {10.1049/ip-com:20050237}, journal = {Communications, IEE Proceedings-}, keywords = {codes, erasure, error-correction, graphs, information, theory}, number = {6}, pages = {1062--1068}, posted-at = {2009-03-22 23:43:33}, priority = {0}, title = {Fountain codes}, url = {http://dx.doi.org/10.1049/ip-com:20050237}, volume = {152}, year = {2005} }

TY - JOUR ID - Mackay-2005-Fountain L3 - citeulike-article-id:1983159 N2 - Fountain codes are record-breaking sparse-graph codes for channels with erasures, such as the internet, where files are transmitted in multiple small packets, each of which is either received without error or not received. Standard file transfer protocols simply chop a file up into K packet-sized pieces, then repeatedly transmit each packet until it is successfully received. A back channel is required for the transmitter to find out which packets need retransmitting. In contrast, fountain codes make packets that are random functions of the whole file. The transmitter sprays packets at the receiver without any knowledge of which packets are received. Once the receiver has received any N packets, where N is just slightly greater than the original file size K, the whole file can be recovered. In the paper random linear fountain codes, LT codes, and raptor codes are reviewed. The computational costs of the best fountain codes are astonishingly small, scaling linearly with the file size. IS - 6 JF - Communications, IEE Proceedings- EP - 1068 TI - Fountain codes VL - 152 T2 - Communications, IEE Proceedings- SP - 1062 KW - codes KW - erasure KW - error-correction KW - graphs KW - information KW - theory AU - Mackay, DJC PY - 2005/// UR - http://dx.doi.org/10.1049/ip-com:20050237 ER -