Based on the erasure channel FEC model as defined in multimedia wireless broadcast standards, we illustrate how doping mechanisms included in the design of erasure coding and decoding may improve the scalability of the packet throughput, decrease overall latency and potentially differentiate among classes of multimedia subscribers regardless of their signal quality. We describe decoding mechani...

We consider a decoder with an erasure option and a variable size list decoder for channels with non-casual side information at the transmitter. First, universally achievable error exponents are offered for decoding with an erasure option using a parameterized decoder in the spirit of Csiszár and Körner’s decoder. Then, the proposed decoding rule is generalized by extending the range of its para...

Using an error models motivated by the Knill, Laflamme, Milburn proposal for efficient linear optics quantum computing [Nature 409,46–52, 2001], error rate thresholds for erasure errors caused by imperfect photon detectors using a 7 qubit code are derived and verified through simulation. A novel method – based on a Markov chain description of the erasure correction procedure – is developed and ...

We address the problem of minimizing the I/O needed to recover from disk failures in erasure-coded storage systems. The principal result is an algorithm that finds the optimal I/O recovery from an arbitrary number of disk failures for any XOR-based erasure code. We also describe a family of codes with high-fault tolerance and low recovery I/O, e.g. one instance tolerates up to 11 failures and r...

An (n; c; `; r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of`-bit packets of total length cn from an n-bit message. The decoding algorithm is able to recover the message from any set of packets whose total length is r, i.e., from any set of r=`packets. We describe erasure codes where both the enco...

We derive density evolution equations for codes on bipartite graphs (BG codes) for the binary erasure channel (BEC). We study the cases of local codes being introduced on only one side of the graph (Generalized LDPC codes) as well as on both sides. Each local code is assumed to correct up to a number of erasures one less than its distance. We define and enumerate stopping sets for BG codes, whi...

Practical recording channels deviate significantly from the oft-used model based on linearity and additive Gaussian noise. Among the well-known anomalies are partial erasure and transition jitter. In this paper, we first describe a precompensation technique to combat the partial erasure effect. It utilizes the unique property of the maximum transition run (MTR) code wherein all dibits are isola...

Security or privacy-critical applications often require access to sensitive information in order to function. But in accordance with the principle of least privilege – or perhaps simply for legal compliance – such applications should not retain said information once it has served its purpose. In such scenarios, the timely disposal of data is known as an information erasure policy. This paper st...

We investigate the problem of routing in opportunistic networks and propose a novel routing algorithm, which combines probabilistic routing with erasure coding. Erasure coding generates large amounts of code blocks with fixed overhead; we apply a sophisticated but realistic method to allocate the generated code blocks to nodes that relies on a probabilistic metric for evaluating node potential....

In this paper, we evaluate the performance of multicast OFDM systems with single and multiple transmit antennas. We have shown that it is possible to increase the data rate of multicast OFDM systems by selecting the users with good channel for each subcarrier. For the single transmit antenna case, the resource allocation has been applied using the two-step algorithm where subcarrier allocation ...