Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

List decoding of the first-order binary Reed-Muller codes

List decoding of the first-order binary Reed-Muller codes A list decoding algorithm is designed for the first-order binary Reed-Muller codes of length n that reconstructs all codewords located within the ball of radius n/2(1 − ɛ) about the received vector and has the complexity of O(n ln2(min{ɛ −2, n})) binary operations. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

List decoding of the first-order binary Reed-Muller codes

Loading next page...
1
 
/lp/springer_journal/list-decoding-of-the-first-order-binary-reed-muller-codes-p05iC7RQ6z

References (9)

Publisher
Springer Journals
Copyright
Copyright © 2007 by Pleiades Publishing, Inc.
Subject
Engineering; Communications Engineering, Networks; Electronic and Computer Engineering; Information Storage and Retrieval; Systems Theory, Control
ISSN
0032-9460
eISSN
1608-3253
DOI
10.1134/S0032946007030052
Publisher site
See Article on Publisher Site

Abstract

A list decoding algorithm is designed for the first-order binary Reed-Muller codes of length n that reconstructs all codewords located within the ball of radius n/2(1 − ɛ) about the received vector and has the complexity of O(n ln2(min{ɛ −2, n})) binary operations.

Journal

Problems of Information TransmissionSpringer Journals

Published: Oct 26, 2007

There are no references for this article.