T-User Uniquely Decodable k-Ary Affine Code for Multiple-Access Adder Channel(Special Section on Information Theory and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• Multi-user uniquely decodable(UD)k-ary coding for the multiple-access adder channel is investigated. It is shown that a T_<f+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.

• 社団法人電子情報通信学会の論文
• 2000-10-25

著者

• Cheng Jun

  The Authors Are With The Department Of Knowledge Eng.and Comp.sci. Doshisha University

• WATANABE Yoichiro

  The authors are with the Department of Knowledge Eng.and Comp.Sci., Doshisha University

• Watanabe Yoichiro

  The Authors Are With The Department Of Knowledge Eng.and Comp.sci. Doshisha University

関連論文

• T-User Uniquely Decodable k-Ary Affine Code for Multiple-Access Adder Channel(Special Section on Information Theory and Its Applications)

スポンサーリンク