Abstract
Given a channel and its input probability distribution, the fundamental lemma of Feinstein assures the existence of a code whose maximum error probability is bounded by a certain known constant. The lemma has been established for discrete-time channels and inputs that possess probability densities. We generalize the lemma for the case of continuous-time channels and inputs that do not possess probability densities.
Sign-in/Register to access full text options 
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.
