Abstract
We present a proof for a conjecture of Majani and Rumsey (1991), which claims that every probability component of each capacity-achieving input probability distribution (IPD) of a finite-input finite-output discrete memoryless channel (DMC) with positive capacity is less than 1 - 1/e, where e = 1+1/1! +1/2! +1/3! +.... = 2.71828182... is the base of natural logarithms.
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
