Computer Science – Information Theory
Scientific paper
2008-11-14
Computer Science
Information Theory
Scientific paper
In this work we study the list-decoding size of Reed-Muller codes. Given a received word and a distance parameter, we are interested in bounding the size of the list of Reed-Muller codewords that are within that distance from the received word. Previous bounds of Gopalan, Klivans and Zuckerman \cite{GKZ08} on the list size of Reed-Muller codes apply only up to the minimum distance of the code. In this work we provide asymptotic bounds for the list-decoding size of Reed-Muller codes that apply for {\em all} distances. Additionally, we study the weight distribution of Reed-Muller codes. Prior results of Kasami and Tokura \cite{KT70} on the structure of Reed-Muller codewords up to twice the minimum distance, imply bounds on the weight distribution of the code that apply only until twice the minimum distance. We provide accumulative bounds for the weight distribution of Reed-Muller codes that apply to {\em all} distances.
Kaufman Tali
Lovett Shachar
No associations
LandOfFree
The List-Decoding Size of Reed-Muller Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The List-Decoding Size of Reed-Muller Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The List-Decoding Size of Reed-Muller Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-11415