New Uniquely Decodable Codes for the $T$-User Binary Adder Channel With $3 \le T \le 5$
Lasse Kiviluoto, Patric R. J. Östergård · IEEE Transactions on Information Theory · 2007
New uniquely decodable (UD) codes for 3-, 4-, and 5-user binary adder channels are obtained in a computer search. These codes improve the highest known rate of UD codes for such channels to (log2/600)6ap1.5381,1.75, and (log2/192)4ap1.8962, respectively