This paper presents a novel algorithm for downloading big files from multiple sources in peer-to-peer networks. The algorithm is simple, but offers several compelling properties. It ensures low handshaking overhead between peers that download files (or parts of a files) from each other. It is computationally efficient, with cost linear in the amount of data transfered. Most importantly, when no...

Attenuation and fading events can corrupt Free Space Optical (FSO) links. It would be so recommended to add mitigation error codes on the communication links. FSO channel can be described as an erasure channel (fading events can cause erasure errors), and we have identified in rateless codes (RCs) a suitable solution to be employed in FSO links. RCs do not need feedback and they add a redundant...

Current rateless codes coding schemes ignored the order recovery of packets. To cope with this problem, average delay and maximum memory consumption were proposed as performance indices to characterize the order recovery performance, then a coding scheme based on two stages coding was proposed to improve the order recovery performance. Encoding of the front k coded symbols is the first stage, w...

In this paper, we propose a new early termination method (ETM) for Luby transform (LT) belief propagation (BP) decoder. The proposed ETM, which we call least reliable messages (LRM), observes only sign alterations of a small cluster in log-likelihood ratio (LLR) messages passing between nodes in BP decoder. Simulation results and complexity analyzes show that LRM significantly lower computation...

Rateless coding has recently been the focus of much practical as well as theoretical research. In this paper we argue that rateless codes find a natural application in non-ergodic channels where the channel law varies unpredictably. Such unpredictability means that to guarantee reliability block-codes are limited by worst-case channel variations. However, the dynamic-decoding nature of rateless...