Uniquely Decodable Code for Three-user Binary Adder Channel
Jianjun Shi, Yoichiro Watanabe · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 1994
A uniquely decodable code (C1,C2,C3) is investigated for the three-user binary adder channel. The uniquely decodable code is constructed as follows: If C1 is a (n. k) linear code with a generator matrix, C2 is a coset of C1 and C3 is a set of all coset leaders, then the code (C1,C2,C3) is uniquely decodable and its total rate is equal to 1+k/n. An easy decoding rule for those codes is also presented.