Maximum likelihood decoding of Reed Solomon codes

Authors:
V. Ponnampalam;B. Vucetic
Affiliations:
-;-
Venue:
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Year:
1996

Citing 0
Cited 3

Improved low-degree testing and its applications

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Reconstructing randomly sampled multivariate polynomials from highly noisy data

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the hardness of permanent

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a bit level soft decision decoding algorithm for Reed-Solomon codes of moderately low complexity. Coset properties of Reed-Solomon codes represented in GF(2) are used to derive an efficient maximum likelihood decoding algorithm. The algorithm could be easily modified to produce soft output estimates.