Repairable Fountain Codes

We introduce a new family of Fountain codes that are systematic and also have sparse parities. Given an input of \(k\) symbols, our codes produce an unbounded number of output symbols, generating each parity independently by linearly combining a logarithmic number of randomly selected input symbols....

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2014-01
Hauptverfasser:	Asteris, Megasthenis, Dimakis, Alexandros G
Format:	Artikel
Sprache:	eng
Schlagworte:	Codes Coding Fields (mathematics) Mathematical analysis Matrix methods Storage systems Symbols
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!