Rateless codes are forward error correcting (FEC) codes of linear encoding-decoding complexity and asymptotically capacity-approaching performance over erasure channels with any erasure statistics. They have been recently recognized as a simple and efficient solution for packetized video transmission over networks with packet erasures. However, to adapt the error correcting capabilities of rate...

In this paper, we propose primitive rateless (PR) codes. A PR code is characterized by the message length and a polynomial over $\mathbf{GF}(2)$, which can generate potentially limitless number of coded symbols. We show that codewords truncated at any arbitrary be represented as subsequences maximum-length sequence ($m$-sequence). characterize Hamming weight distribution codes their duals for p...

In this thesis we examine two different rateless codes and create a rateless unequal error protection code, all for the additive white Gaussian noise (AWGN) channel. The two rateless codes are examined through both analysis and simulation with the hope of developing a better understanding of how the codes will perform and pushing the codes further toward implementation. After analyzing and simu...

We propose a new parameter for optimizing the performance of rateless codes by minimizing latency and data overhead. We call it Latency-Overhead Product (LOP). It is based on ideas used in the analysis of digital circuits. We demonstrate the effectiveness of the LOP parameter for a specific class of rateless codes called Online codes (OC). We give results from experiments in ideal channel and s...

Rateless codes, also known as fountain codes, are a class of erasure error-control codes that are particularly well suited for broadcast/ multicast systems. Raptor codes, as a particularly successful implementation of digital fountain codes, have been used as the applicationlayer forward error correction (FEC) codes in the third generation partnership program (3GPP) Multimedia Broadcast and Mul...

It is possible to recover the original data from a certain amount of encoded data by using rateless codes, which are utilized for multicast streaming. In this paper, we propose an effective replication technique using rateless codes for unstructured P2P networks. More specifically, we propose a method to spread and find chunks generated from files efficiently. Through simulation experiments, we...

We introduce online codes – a class of near-optimal codes for a very general loss channel which we call the free channel. Online codes are linear encoding/decoding time codes, based on sparse bipartite graphs, similar to Tornado codes, with a couple of novel properties: local encodability and rateless-ness. Local encodability is the property that each block of the encoding of a message can be c...

In this paper, we study the design of a causal anytime encoding and decoding scheme for transmission of realtime information over a binary symmetric channel. In particular, our scheme combines unequal-error protection (UEP) rateless codes with sequential belief propagation decoding. In order to minimize delay in decoding and reduce distortion, we formulate and solve a linear programming problem...

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 advanta...