T-User Uniquely Decodable k-Ary Affine Code for Multiple-Access Adder Channel
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E83-A No.10 pp.1914-1920
- Publication Date
- 2000/10/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Multiple Access Channel
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jun CHENG, Yoichiro WATANABE, "T-User Uniquely Decodable k-Ary Affine Code for Multiple-Access Adder Channel" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 10, pp. 1914-1920, October 2000, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_10_1914/_p
Copy
@ARTICLE{e83-a_10_1914,
author={Jun CHENG, Yoichiro WATANABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={T-User Uniquely Decodable k-Ary Affine Code for Multiple-Access Adder Channel},
year={2000},
volume={E83-A},
number={10},
pages={1914-1920},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - T-User Uniquely Decodable k-Ary Affine Code for Multiple-Access Adder Channel
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1914
EP - 1920
AU - Jun CHENG
AU - Yoichiro WATANABE
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2000
AB - 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.
ER -
English
