Decoding of Reed-Muller codes with polylogarithmic complexity

Authors:
Ilya Dumer
Affiliations:
University of California, Riverside, CA
Venue:
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Year:
2004

Citing 3
Cited 1

A hard-core predicate for all one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Learning Polynomials with Queries: The Highly Noisy Case

SIAM Journal on Discrete Mathematics
Soft-decision majority decoding of Reed-Muller codes

IEEE Transactions on Information Theory

List-decoding reed-muller codes over small fields

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Code transmission is considered over a binary symmetric (BS) channel whose bit error probability is arbitrarily close to 1/2. New recursive decoding algorithms are designed for Reed-Muller (RM) codes of growing length 2m and fixed order r. The algorithms retrieve all information with a vanishing error probability and polylogarithmic complexity of order mr+1.