By Topic

List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Dumer, I. ; California Univ., Riverside, CA ; Kabatiansky, G. ; Tavernier, C.

A new deterministic list decoding algorithm is proposed for general Reed-Muller codes RM(s,m) of length n = 2m and distance d = 2m-epsi. Given n and d, the algorithm performs beyond the bounded distance threshold of d/2 and has a low complexity order of nmepsi-1 for any decoding radius T that is less than the Johnson bound

Published in:

Information Theory, 2006 IEEE International Symposium on

Date of Conference:

9-14 July 2006