Title :
On the Packet Lengths of Rateless Codes
Author :
Vukobratovic, Dejan ; Despotovic, Miroslav
Author_Institution :
Dept. of Telecommun. & Signal Process., Novi Sad Univ.
Abstract :
Erasure correcting codes, particularly the codes suitable for reliable multicast over the Internet connections, became increasingly popular for the coding research community lately, due to invention of the so called rateless (or digital fountain) codes. Rateless codes are simple and elegant solution to a problem of transmission of information over the (packet) erasure channels. In this paper we give a simulation study of rateless codes, but with a deeper look at the underlying erasure communication channel. Namely, we extend the models of a simple erasure channels found in a literature with a more realistic assumption that the erasure rates are packet length dependent. We ask ourselves a question of the suitable packet lengths when using rateless codes in the particular settings
Keywords :
codes; multicast communication; packet switching; telecommunication channels; LT codes; erasure communication channel; erasure correcting codes; information transmission; packet erasure channels; packet length; packet lengths; raptor codes; rateless codes; Automatic repeat request; Channel coding; Decoding; Error correction codes; Feedback; Forward error correction; Parity check codes; Transmitters; LT codes; erasure channel; raptor codes; rateless codes;
Conference_Titel :
Computer as a Tool, 2005. EUROCON 2005.The International Conference on
Conference_Location :
Belgrade
Print_ISBN :
1-4244-0049-X
DOI :
10.1109/EURCON.2005.1630019