Abstract
Tree encoding and sequential decoding are considered for noisy channels that respond a random number of times to each input. Such channels appear in mathematical models of certain speech recognition systems. The decoding error probability and the channel capacity are bounded by extension of the methods of Jelinek and Zigangirov to noisy multilevel channels with input-dependent insertions. Certain analytical difficulties peculiar to the channels in question are indicated.
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.
