On a conjecture of Majani and Rumsey
We present a proof for a conjecture of Majani and Rumsey, 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.
Publication Source (Journal or Book title)
IEEE International Symposium on Information Theory - Proceedings
Liang, X. (2004). On a conjecture of Majani and Rumsey. IEEE International Symposium on Information Theory - Proceedings, 60. Retrieved from https://digitalcommons.lsu.edu/eecs_pubs/841