Abstract

Suboptimal decoding of linear codes in symmetric memoryless channels is considered. For the q-ary codes of length n /spl rarr/ /spl infin/ and code rate R the number of decoding operations is upper bounded by the value q/sup n(c+o(1)), where o(1) /spl rarr/ 0 and c = min(R(1 - R), (1 - R)/2). The decoding error probability /spl epsi/ is upper bounded by the double error probability /spl epsi//sub e/ of maximum likelihood (ML) decoding, while /spl epsi/ /spl sim/ /spl epsi//sub e/, when n /spl rarr/ /spl infin/. For the channels with discrete (quantified) output the better estimate c = R(1 - R)/(1 + R) is obtained.

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.