A New Class of Rateless Codes Based on Reed–Solomon Codes

Borujeny, Reza Rafie; Ardakani, Masoud

doi:10.1109/tcomm.2015.2502952

Cited by 10 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rateless codes have generated a lot of interest as a promising forward error correction (FEC) technique [2]. Being able to adapt both the code construction and the number of parity symbols to time-varying channel conditions [3], [4], rateless codes hold the potential for achieving the capacity with relatively short delays compared to fixed-rate codes, which have fixed code construction and codeword length. Since rateless codes are able to transmit information adaptive Part of this work will be presented at GLOBECOM16 [1].…”

Section: A Motivationmentioning

confidence: 99%

“…This follows by noting that the spectral efficiency term log 2 (1 + SIR i (τ )) in (5) is a convex function of I i (τ ) and subsequently applying Jensen's inequality for convex functions to C i (t) in (5). 4 For remainder of the paper, the term "average interference" refers to time averaging. 8 The receiver in (6) is a practical choice since it requires only an estimate of the channel gain from the serving BS and no knowledge of the interference power.…”

Section: System Modelmentioning

confidence: 99%

See 1 more Smart Citation

Enhanced Cellular Coverage and Throughput Using Rateless Codes

Rajanna

Haenggi

2017

IEEE Trans. Commun.

View full text Add to dashboard Cite

Rateless codes have been shown to provide robust error correction over a wide range of binary and noisy channels. Using a stochastic geometry model, this paper studies the performance of rateless codes in the cellular downlink and compares it with the performance of fixed-rate codes. For the case of Rayleigh fading, an accurate approximation is proposed for the distribution of the packet transmission time of K-bit information packets using rateless codes. The two types of channel coding schemes are compared by evaluating the typical user and per-user success probability and the rate. Based on both the analytical results and simulations, the paper shows that rateless coding provides a significant throughput gain relative to fixed-rate coding. Moreover the benefit is not restricted to the typical user but applies to all users in the cellular network.

show abstract

Section: A Motivationmentioning

confidence: 99%

Section: System Modelmentioning

confidence: 99%

Enhanced Cellular Coverage and Throughput Using Rateless Codes

Rajanna

Haenggi

2017

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…1. We assume the RLN-C and RS-C are of parameters [160, 128] 256 and constructed in the usual way [27]- [29]. As LDPC-C we use the AR4JA code [30], [31] of equivalent parameters [1280, 1024] 2 .…”

Section: Maximum Code Diversitymentioning

confidence: 99%

Babel Storage: Uncoordinated Content Delivery from Multiple Coded Storage Systems

Neu

Médard

2019

2019 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

In future content-centric networks, content is identified independently of its location. From an end-user's perspective, individual storage systems dissolve into a seemingly omnipresent structureless 'storage fog'. Content should be delivered oblivious of the network topology, using multiple storage systems simultaneously, and at minimal coordination overhead. Prior works have addressed the advantages of error correction coding for distributed storage and content delivery separately. This work takes a comprehensive approach to highlighting the tradeoff between storage overhead and transmission overhead in uncoordinated content delivery from multiple coded storage systems.Our contribution is twofold. First, we characterize the tradeoff between storage and transmission overhead when all participating storage systems employ the same code. Second, we show that the resulting stark inefficiencies can be avoided when storage systems use diverse codes. What is more, such code diversity is not just technically desirable, but presumably will be the reality in the increasingly heterogeneous networks of the future. To this end, we show that a mix of Reed-Solomon, low-density paritycheck and random linear network codes achieves close-to-optimal performance at minimal coordination and operational overhead.

show abstract

“…Such an approach was also termed digital fountain or fountain codes [32], the most well known designs being the Luby Transform (LT) [30] and raptor codes [41]. A great deal of research is still going on to devise rateless codes whose decoding complexity and communication overhead are reduced [12,17,18,25,36,38,40]; at the same time, the design of locally repairable codes that allow efficient reconstruction of lost blocks carrying equations is still an active source of Rossano Gaeta rossano.gaeta@unito.it 1 Dipartimento di Informatica, Università di Torino, Corso Svizzera 189, 10149 Torino, Italy interesting proposals [3,4,28,39]. A recent survey [10] nicely summarizes the main developments in rateless codes research.…”

Section: Introductionmentioning

confidence: 99%

On the robustness of three classes of rateless codes against pollution attacks in P2P networks

Gaeta

Grangetto

2021

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

Rateless codes (a.k.a. fountain codes, digital fountain) have found their way in numerous peer-to-peer based applications although their robustness to the so called pollution attack has not been deeply investigated because they have been originally devised as a solution for dealing with block erasures and not for block modification. In this paper we provide an analysis of the intrinsic robustness of three rateless codes algorithms, i.e., random linear network codes (RLNC), Luby transform (LT), and band codes (BC) against intentional data modification. By intrinsic robustness we mean the ability of detecting as soon as possible that modification of at least one equation has occurred as well as the possibility a receiver can decode from the set of equations with and without the modified ones. We focus on bare rateless codes where no additional information is added to equations (e.g., tags) or higher level protocol are used (e.g., verification keys to pre-distribute to receivers) to detect and recover from data modification. We consider several scenarios that combine both random and targeted selection of equations to alter and modification of an equation that can either change the rank of the coding matrix or not. Our analysis reveals that a high percentage of attacks goes undetected unless a minimum code redundancy is achieved, LT codes are the most fragile in virtually all scenarios, RLNC and BC are quite insensitive to the victim selection and type of alteration of chosen equations and exhibit virtually identical robustness although BC offer a low complexity of the decoding algorithm.

show abstract

A New Class of Rateless Codes Based on Reed–Solomon Codes

Cited by 10 publications

References 18 publications

Enhanced Cellular Coverage and Throughput Using Rateless Codes

Enhanced Cellular Coverage and Throughput Using Rateless Codes

Babel Storage: Uncoordinated Content Delivery from Multiple Coded Storage Systems

On the robustness of three classes of rateless codes against pollution attacks in P2P networks

Contact Info

Product

Resources

About