Practical loss-resilient codes

Luby, Michael; Mitzenmacher, Michael; Shokrollahi, Mohammad Amin; Spielman, Daniel A.; Stemann, Volker

doi:10.1145/258533.258573

Cited by 570 publications

(432 citation statements)

References 12 publications

Supporting

Mentioning

424

Contrasting

Unclassified

Order By: Relevance

“…Descriptions and explanations of Tornado codes can be found in [27,26,25,5]. It was the code developed to realise the idea of the digital fountain after finding problems in using erasure RS codes.…”

Section: The Concept Of Tornado Codesmentioning

confidence: 99%

“…It was the code developed to realise the idea of the digital fountain after finding problems in using erasure RS codes. In contrast with RS codes' more than quadratic encoding and decoding time for practical values of n [5,3,41], Tornado codes achieve linear encoding and decoding times with the cost of small additional overhead at the receivers [26,18]. Tornado codes are systematic codes and they are "rateful" -the code rate must be predetermined.…”

Section: The Concept Of Tornado Codesmentioning

confidence: 99%

See 1 more Smart Citation

Investigation of forward error correction coding schemes for a broadcast communication system

Wang

Willig

Woodward

2013

2013 Australasian Telecommunication Networks and Applications Conference (ATNAC)

View full text Add to dashboard Cite

To the 365 days I spent in NZi3. AbstractThis thesis investigates four FEC (forward error correction) coding schemes for their suitability for a broadcast system where there is one energy-rich transmitter and many energy-constrained receivers with a variety of channel conditions. The four coding schemes are: repetition codes (the baseline scheme); Reed-Solomon (RS) codes; Luby-Transform (LT) codes; and a type of RS and LT concatenated codes. The schemes were tested in terms of their ability to achieve both high average data reception success probability and short data reception time at the receivers (due to limited energy). The code rate (R c ) is fixed to either 1/2 or 1/3. Two statistical channel models were employed: the memoryless channel and the Gilbert-Elliott channel. The investigation considered only the data-link layer behaviour of the schemes. During the course of the investigation, an improvement to the original LT encoding process was made, the name LTAM (LT codes with Added Memory) was given to this improved coding method. LTAM codes reduce the overhead needed for decoding short-length messages. The improvement can be seen for decoding up to 10000 number of user packets. The maximum overhead reduction is as much as 10% over the original LT codes.The LT-type codes were found to have the property that can both achieve high success data reception performance and flexible switch off time for the receivers. They are also adaptable to different channel characteristics. Therefore it is a prototype of the ideal coding scheme that this project is looking for. This scheme was then further developed by applying an RS code as an inner code to further improve the success probability of packet reception. The results show that LT&RS code has a significant improvement in the channel error tolerance over that of the LT codes without an RS code applied. The trade-off is slightly more reception time needed and more decoding complexity. This LT&RS code is then determined to be the best scheme that fulfils the aim in the context of this project which is to find a coding scheme that both has a high overall data reception probability and short overall data reception time.Comparing the LT&RS code with the baseline repetition code, the improvement is in three aspects. Firstly, the LT&RS code can keep full success rate over channels have approximately two orders of magnitude more errors than the repetition code. This is for the two channel models and two code rates tested. Secondly, the LT&RS code shows an exceptionally good performance under burst error channels. It is able to maintain more than 70% success rate under the long burst error channels where both the repetition code and the RS code have almost zero success probability. Thirdly, while the success rates are improved, the data reception time, measured in terms of number of packets needed to be received at the receiver, of the LT&RS codes can reach a maximum of 58% reduction for R c = 1/2 and 158% reduction for R c = 1/3 compared with both the repetition code and th...

show abstract

Section: The Concept Of Tornado Codesmentioning

confidence: 99%

Section: The Concept Of Tornado Codesmentioning

confidence: 99%

Investigation of forward error correction coding schemes for a broadcast communication system

Wang

Willig

Woodward

2013

2013 Australasian Telecommunication Networks and Applications Conference (ATNAC)

View full text Add to dashboard Cite

show abstract

“…Different erasure coding schemes such as Reed-Solomon codes [11] and Tornado codes [12] are available. They differ in their encoding/decoding times and decoding efficiency which determines the number of coded packets required to reconstruct the original message.…”

Section: Erasure Coding Based Approachmentioning

confidence: 99%

Routing in Opportunistic Networks

Santi

2012

Mobility Models for Next Generation Wireless Networks

View full text Add to dashboard Cite

“…A traditional (n, k) erasure code, such as Reed-Solomon codes and Tornado codes [5,6], is a forward error correction code with parameters k, the number of original symbols, and n, the number of coded symbols. The ratio k/n is referred to as the rate of the code.…”

Section: Source Coding With Rateless Codesmentioning

confidence: 99%

Outburst: Efficient Overlay Content Distribution with Rateless Codes

2007

NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet

View full text Add to dashboard Cite

Abstract. The challenges of significant network dynamics and limited bandwidth capacities have to be considered when designing efficient algorithms for distributing large volumes of content in overlay networks. This paper presents Outburst, a novel approach for overlay content distribution based on rateless codes. In Outburst, we code content bitstreams with rateless codes at the source, and take advantage of the superior properties of rateless codes to provide resilience against network dynamics and node failures. We recode the bitstreams at each receiver node, so that the need for content reconciliation in parallel downloading is eliminated, and the delivery of redundant content is minimized. The effectiveness and efficiency of Outburst are demonstrated with simulations.

show abstract

Practical loss-resilient codes

Cited by 570 publications

References 12 publications

Investigation of forward error correction coding schemes for a broadcast communication system

Investigation of forward error correction coding schemes for a broadcast communication system

Routing in Opportunistic Networks

Outburst: Efficient Overlay Content Distribution with Rateless Codes

Contact Info

Product

Resources

About