Abstract
It is shown that minimum distance decoding of linear codes is accomplished by generating all codewords corresponding to all information sets utilizing the corresponding received coordinates. This was previously shown for the special case of maximum distance separable codes. It is shown that for codes over moderate or larger sized fields this method is more effective than that of generating all codewords.
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 callDisclaimer: 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.
