Decentralised distributed fountain coding: asymptotic analysis and design

Authors:
Dino Sejdinovic;Robert Piechocki;Angela Doufexi;Mohamed Ismail
Affiliations:
Centre for Communications Research, Department of Electrical and Electronic Engineering, University of Bristol, Bristol, UK;Centre for Communications Research, Department of Electrical and Electronic Engineering, University of Bristol, Bristol, UK;Centre for Communications Research, Department of Electrical and Electronic Engineering, University of Bristol, Bristol, UK;Toshiba Research Europe Ltd, Telecommunications Research Laboratory, Bristol, UK
Venue:
IEEE Communications Letters
Year:
2010

Citing 5
Cited 1

Analysis of random processes via And-Or tree evaluation

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Raptor codes

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Expanding window fountain codes for unequal error protection

IEEE Transactions on Communications
Rateless Codes With Unequal Error Protection Property

IEEE Transactions on Information Theory

Rateless distributed source code design

Proceedings of the 5th International ICST Mobile Multimedia Communications Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

A class of generic decentralised distributed fountain coding schemes is introduced and the tools of analysis of the performance of such schemes are presented. It is demonstrated that the developed approach can be used to formulate a robust code design methodology in a number of instances. We show that two non-standard applications of fountain codes, fountain codes for distributed source coding and fountain codes for unequal error protection lie within this decentralised distributed fountain coding framework.