Abstract

Wu's list decoding algorithm, when restricted to binary codes, allows decoding up to the binary Johnson bound. Unfortunately, in the vast majority of cases, this bound is not capable to reach the covering radius R of the code, and this implies that some n-tuples do exist that are not list decodable. Nevertheless we prove that a class of Reed-Muller codes it exists, for which the decoding radius τwu is greater than or equal to the covering radius. This situation is the list decoding counterpart of perfect codes.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.