<i>T</i>-user uniquely decodable <i>k</i>-ary affine code for multiple-access adder channel

作     者：Cheng, J Watanabe, Y 

作者机构：Doshisha Univ Dept Knowledge Engn & Comp Sci Kyotanabe 6100321 Japan 

出 版 物：《IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES》 (电子信息通信学会汇刊：电子学、通信及计算机科学基础)

年 卷 期：2000年第E83A卷第10期

页      面：1914-1920页

核心收录：

学科分类：0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：multiple-access communication adder channel multi-user code affine code uniquely decodable code 

摘      要：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 T-f-user and T-g-user UD k-ary affine codes. This leads to construct recursively a T-n-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.