Title :
Capacity bound for a noiseless T-user binary adder channel
Author_Institution :
Lehrstuhl fur Nachrichtentechnik, Tech. Univ. Munchen, Germany
fDate :
6/20/1996 12:00:00 AM
Abstract :
The author proves an upper bound on the sum capacity of a noiseless T-user binary adder channel, thus settling a conjecture made by Chang and Weldon (1979). The bound is asymptotically tight and enables a more accurate performance evaluation of some very recent code constructions
Keywords :
channel capacity; codes; information theory; multi-access systems; binary adder channel; capacity bound; code constructions; noiseless T-user channel; performance evaluation; upper bound;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19960817
