On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size

Recently there has been interest in the construction of small parity check sets for iterative decoding of the Hamming code with the property that each uncorrectable (or stopping) set of size three is the support of a codeword and hence uncorrectable anyway. Here we reformulate and generalise the pro...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2005-07
Hauptverfasser:	Hollmann, Henk D L, Ludo M G M Tolhuizen
Format:	Artikel
Sprache:	eng
Schlagworte:	Check collections Codes Collection Decoding Hamming codes Parity
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!