Decoding of second order Reed-Muller codes with a large number of errors

Second order Reed-Muller codes are considered over a binary symmetric channel. We present a modified version of V.M Sidel'nikov and A.S. Pershakov algorithm, Problemy Peredachi Informatsii 1992, that has complexity of order n/sup 2/log(n). Experimental results show that the algorithm corrects m...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity (ITW 2005) Rotoruan New Zealand, August 29 - September 1, 2005 S. 3 pp.
1. Verfasser:	Bassem Sakkour
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 2005
Schlagworte:	Algorithm design and analysis Character generation Communication channels Encoding Error correction Error correction codes Euclidean distance Hamming distance Linearity Maximum likelihood decoding
ISBN:	9780780394803, 0780394801
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!