Generating parity check equations for bounded-distance iterative erasure decoding

A generic $(r,m)$-erasure correcting set is a collection of vectors in $\bF_2^r$ which can be used to generate, for each binary linear code of codimension $r$, a collection of parity check equations that enables iterative decoding of all correctable erasure patterns of size at most $m$. That is to s...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Hollmann, Henk D. L, Tolhuizen, Ludo M. G. M
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Information Theory Mathematics - Information Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!