T-User Uniquely Decodable k-Ary Affine Code for Multiple-Access Adder Channel

Jun CHENG  Yoichiro WATANABE  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E83-A   No.10   pp.1914-1920
Publication Date: 2000/10/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Multiple Access Channel
multiple-access communication,  adder channel,  multi-user code,  affine code,  uniquely decodable code,  

Full Text: PDF(330.7KB)>>
Buy this Article

Multi-user uniquely decodable (UD) k-ary coding for the multiple-access adder channel is investigated. It is shown that a Tf+g+1-user UD k-ary affine code with code length f+g+1 can be obtained from two Tf-user and Tg-user UD k-ary affine codes. This leads to construct recursively a Tn-user UD k-ary affine code with arbitrary code length n. The total rate of the code tends to be higher than those of all the multi-user UD k-ary codes reported previously as the number of users increases.