Capacity bound for a noiseless T -user binaryadder channel
Wai Ho Mow · Electronics Letters · 1996
The author proves an upper bound on the sum capacity of a noiseless T-user binary adder channel, thus settling a conjecture made in 1979 by Chang and Weldon. The bound is asymptotically tight and enables a more accurate performance evaluation of some very recent code constructions.