Title :
On a conjecture of Majani and Rumsey
Author_Institution :
Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA
fDate :
27 June-2 July 2004
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.
Keywords :
channel capacity; memoryless systems; probability; Majani Rumsey-conjecture; finite-input finite-output discrete memoryless channel; natural logarithm; probability component; probability distribution; Capacity planning; Entropy; Memoryless systems; Monte Carlo methods; Probability distribution; Upper bound;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365099
