<I>T</I>-User Code with Arbitrary Code Length for Multiple-Access Adder Channel

Jun CHENG; Yoichiro WATANABE

T-User Code with Arbitrary Code Length for Multiple-Access Adder Channel

Jun CHENG, Yoichiro WATANABE

Full Text Views

0

Cite this

Summary :

A T-user uniquely decodable (UD) code {C₁,C₂,,C_T} over an integer set {0,1,,k} with arbitrary code length is developed for a multiple-access adder channel (MAAC). Each of the T users is equipped with two codewords, one of which is zero vector. The T-user UD code is used to identify users through the MAAC. It is shown that a T(f+g+1)-user UD code with code length f+g+1 can be arranged from two given T(f)-user and T(g)-user UD codes. This idea makes it possible to construct recursively a T-user UD code for an arbitrary code length n and a positive integer k. The T-user UD code includes the Jevticode.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E82-A No.10 pp.2011-2016

Publication Date: 1999/10/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)

Category: Coding Theory

Cite this

Copy

Jun CHENG, Yoichiro WATANABE, "T-User Code with Arbitrary Code Length for Multiple-Access Adder Channel" in IEICE TRANSACTIONS on Fundamentals, vol. E82-A, no. 10, pp. 2011-2016, October 1999, doi: .
Abstract: A T-user uniquely decodable (UD) code {C₁,C₂,,C_T} over an integer set {0,1,,k} with arbitrary code length is developed for a multiple-access adder channel (MAAC). Each of the T users is equipped with two codewords, one of which is zero vector. The T-user UD code is used to identify users through the MAAC. It is shown that a T(f+g+1)-user UD code with code length f+g+1 can be arranged from two given T(f)-user and T(g)-user UD codes. This idea makes it possible to construct recursively a T-user UD code for an arbitrary code length n and a positive integer k. The T-user UD code includes the Jevticode.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_10_2011/_p

Copy

@ARTICLE{e82-a_10_2011,
author={Jun CHENG, Yoichiro WATANABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={T-User Code with Arbitrary Code Length for Multiple-Access Adder Channel},
year={1999},
volume={E82-A},
number={10},
pages={2011-2016},
abstract={A T-user uniquely decodable (UD) code {C₁,C₂,,C_T} over an integer set {0,1,,k} with arbitrary code length is developed for a multiple-access adder channel (MAAC). Each of the T users is equipped with two codewords, one of which is zero vector. The T-user UD code is used to identify users through the MAAC. It is shown that a T(f+g+1)-user UD code with code length f+g+1 can be arranged from two given T(f)-user and T(g)-user UD codes. This idea makes it possible to construct recursively a T-user UD code for an arbitrary code length n and a positive integer k. The T-user UD code includes the Jevticode.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - T-User Code with Arbitrary Code Length for Multiple-Access Adder Channel
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2011
EP - 2016
AU - Jun CHENG
AU - Yoichiro WATANABE
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1999
AB - A T-user uniquely decodable (UD) code {C₁,C₂,,C_T} over an integer set {0,1,,k} with arbitrary code length is developed for a multiple-access adder channel (MAAC). Each of the T users is equipped with two codewords, one of which is zero vector. The T-user UD code is used to identify users through the MAAC. It is shown that a T(f+g+1)-user UD code with code length f+g+1 can be arranged from two given T(f)-user and T(g)-user UD codes. This idea makes it possible to construct recursively a T-user UD code for an arbitrary code length n and a positive integer k. The T-user UD code includes the Jevticode.
ER -