Abstract
Abstract Forney's generalization of maximum likelihood decoding scheme takes care of erasures. From a tactical point of view it may be desired to consider multiple decoding schemes. This problem for a discrete memoryless channel has been handled in this paper and bounds on probability of error and erasure have been derived after modifying Forney's scheme for multiple decoders.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
