Abstract

A decision criterion called LR+Th for decision feedback scheme was proposed by Hashimoto. Though Forney’s decision criterion (FR) is optimal and meets the Neyman-Pearson’s lemma, LR+Th is suboptimal. However, the error exponent of LR+Th is shown to be asymptotically equivalent to that of FR by random coding arguments for block codes. In this paper, applying the technique of DS2 bound, we derive an upper bound for the error probability of LR+Th with the ensemble of linear block codes. It elucidates the relation between the random coding exponents of block codes and those of linear block codes.

Full Text
Paper version not known

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.