Abstract
-The binary input JV-user adder channel models a communication media accessed simultaneously by N users. Each user transmits a binary codeword of length n chosen from its codebook and the channel output consists of a componentwise arithmetic sum of the binary digits. Van Tilborg [1] gave an upper bound on the size of a uniquely decodable code for the two-user case. His work is generalized here to the Nuser case. The results give interesting information on the existence and properties of such codes. Index Terms-JV-user adder channel, uniquely decodable codes.
| Original language | English |
|---|---|
| Pages (from-to) | 334-340 |
| Number of pages | 7 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 44 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1998 |
| Externally published | Yes |