Access the full text.
Sign up today, get DeepDyve free for 14 days.
Oded Goldreich, L. Levin (1989)
A hard-core predicate for all one-way functions
R. Pellikaan, Xinwen Wu (2004)
List decoding of q-ary Reed-Muller codesIEEE Transactions on Information Theory, 50
F. MacWilliams, N. Sloane (1977)
The Theory of Error-Correcting Codes
S. Litsyn, O. Shekhovtsov (1983)
Fast Decoding Algorithms for First-Order Reed-Muller CodesProbl. Peredachi Inf., 19
I. Dumer, G. Kabatiansky, C. Tavernier (2006)
List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity2006 IEEE International Symposium on Information Theory
P. Elias (1957)
List decoding for noisy channels
Oded Goldreich, R. Rubinfeld, M. Sudan (1995)
Learning polynomials with queries: The highly noisy caseProceedings of IEEE 36th Annual Foundations of Computer Science
O. Goldreich, R. Rubinfeld, M. Sudan (2000)
Learning Polynomials with Queries: The Highly Noisy CaseSIAM J. Discrete Math., 13
L.A. Bassalygo (1965)
New Upper Bounds for Error Correcting CodesProbl. Peredachi Inf., 1
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.
Problems of Information Transmission – Springer Journals
Published: Oct 26, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.