Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:We-AM-1-4
Session:
Number:We-AM-1-4.2
Recursive Construction of k-Ary Uniquely Decodable Codes for Multiple-Access Adder Channel
Shan Lu, Wei Hou, Jun Cheng, Hiroshi Kamabe,
pp.597-601
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.We-AM-1-4.2
PDF download
Summary:
A recursive construction of k-ary uniquely decodable multiuser codes is proposed for use in a noiseless multipleaccess adder channel. The code rates of the proposed codes are higher than those of previous uniquely decodable multiuser codes. A recursive decoding algorithm is also proposed.