Coding for the Multiple-Access Adder Channel
The coding problem for the multiple-access adder channel is considered, both for the case of permanent user activity and partial user activity. For permanent user activity, Khachatrian  has written an excellent survey for general, symmetric and non-symmetric rates. In this survey, we only deal with the special symmetric rate case, where all users have two codewords. The length of the shortest possible code is characterized, and amongst others, we present the code construction of Chang and Weldon . We also deal with the case of signature coding (where we mean that one of the codewords for each user is the zero vector). As a code construction of this kind, we show Lindström’s one .
We also consider partial user activity. For this case, the resulting upper and lower bounds on the length of the shortest possible code differs by a factor of two. There are some constructions for suboptimal codes, but we do not know about constructions with length approaching the upper bound. The signature code is similar to the B m code examined by D’yachkov and Rykov . It is interesting, that the upper and lower bounds for the length of B m codes are the same as for signature codes.
KeywordsActive User Code Length Zero Vector Signature Code Component Code
Unable to display preview. Download preview PDF.
- 1.Ahlswede, R.: Multi–way communication channels. In: Proceedings of the 2nd International Symposium on Information Theory, Hungarian Academy of Sciences, pp. 23–52 (1971)Google Scholar
- 8.Erdős, P., Rényi, A.: On two problems of information theory. Publications of the Mathematical Institute of the Hungarian Academy of Science 8, 229–243 (1963)Google Scholar
- 10.Khachatrian, G.H.: A survey of coding methods for the adder channel. In: Alth”ofer, I., Cai, N., Dueck, G., Khachatrian, L., Pinsker, M., Sárközy, A., Wegener, I., Zhang, Z. (eds.) Numbers, Information, and Complexity (Festschrift for Rudolf Ahlswede), pp. 181–196. Kluwer, Dordrecht (2000)Google Scholar
- 11.Liao, H.: A coding theorem for multiple access communications. In: Proceedings of the International Symposium on Information Theory (1972)Google Scholar
- 13.Lindström, B.: Determining subsets by unramified experiments. In: Srivastava, J. (ed.) A Survey of Statistical Designs and Linear Models, pp. 407–418. North Holland Publishing Company, Amsterdam (1975)Google Scholar
- 14.Shannon, C.E.: Two–way communication channels. In: Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 611–644. University of California Press (1961)Google Scholar
- 15.van der Meulen, E.C.: The discrete memoryless channel with two senders and one receiver. In: Proceedings of the 2nd International Symposium on Information Theory, Hungarian Academy of Sciences, pp. 103–135 (1971)Google Scholar