Abstract
The discrete memoryless multiple-access channel with random parameter is investigated. Various situations, when the state of the channel is known or unknown on the encoders and decoder, are considered. Some bounds of E-capacity and capacity regions for average error probability are obtained.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahlswede, R.: Multi-way communication channels. In: 2nd Intern. Sympos. Inform. Theory. Tsahkadsor, Armenia, 1971, Budapest, Akad. Kiado, pp. 23–52 (1973)
Ahlswede, R.: The capacity region of a channel with two senders and two receivers. Annals Probability 2(2), 805–814 (1974)
Haroutunian, E.A., Haroutunian, M.E., Avetissian, A.E.: Multiple-access channel achievable rates region and reliability. Izvestiya Akademii Nauk Armenii, Matematika 27(5), 51–68 (1992)
Haroutunian, M.E.: On E-capacity region of multiple-access channel (in Russian). Izvestiya Akademii Nauk Armenii, Matematika 38(1), 3–22 (2003)
Gallager, R.G.: A perspective on multiaccess channels. IEEE Trans. Inform. Theory 31(1), 124–142 (1985)
Dyachkov, A.G.: Random constant composition codes for multiple access channels. Problems of Control and Inform. Theory 13(6), 357–369 (1984)
Pokorny, J., Wallmeier, H.M.: Random coding bound and codes produced by permutations for the multiple-access channel. IEEE Trans. Inform. Theory 31, 741–750 (1985)
Liu, Y.S., Hughes, B.L.: A new universal coding bound for the multiple-access channel. IEEE Trans. Inform. Theory 42, 376–386 (1996)
Gelfand, S.I., Pinsker, M.S.: Coding for channel with random parameters. Problems of Control and Inform. Theory 8(1), 19–31 (1980)
Haroutunian, E.A., Haroutunian, M.E.: E-capacity upper bound for channel with random parameter. Problems of Control and Information Theory 17(2), 99–105 (1988)
Haroutunian, M.E.: Bounds of E-capacity for the channel with random parameter. Problemi Peredachi Informatsii (in Russian) 27(1), 14–23 (1991)
Haroutunian, M.E.: New bounds for E-capacities of arbitrarily varying channel and channel with random parameter. Trans. IIAP NAS RA and YSU, Mathematical Problems of Computer sciences 22, 44–59 (2001)
Jahn, J.: Coding of arbitrarily varying multiuser channels. IEEE Trans. Inform. Theory 27(2), 212–226 (1981)
Ahlswede, R.: Arbitrarily varying channels with states sequence known to the sender. IEEE Trans. Inform. Theory 32(5), 621–629 (1986)
Ahlswede, R., Cai, N.: Arbitrarily varying multiple access channels, Part 1. IEEE Trans. Inform. Theory 45(2), 742–749 (1999)
Ahlswede, R., Cai, N.: Arbitrarily varying multiple access channels, Part 2. IEEE Trans. Inform. Theory 45(2), 749–756 (1999)
Das, A., Narayan, P.: Capacities of time-varying multiple-access channels with side information. IEEE Transactions on Information Theory 48(1), 4–25 (2002)
Pinsker, M.S.: Multi-user channels. In: II Joint Swedish-Soviet Intern. workshop on Inform. Theory, Granna, Sweden, pp. 160–165 (1985)
Csiszár, I., Körner, J.: Information Theory. Coding Theorems for Discrete Memoryless Systems, Budapest, Akad. Kiado (1981)
Csiszár, I.: The method of types. IEEE Trans. Inform. Theory 44, 2505–2523 (1998)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Haroutunian, M.E. (2006). Bounds of E-Capacity for Multiple-Access Channel with Random Parameter. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_10
Download citation
DOI: https://doi.org/10.1007/11889342_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46244-6
Online ISBN: 978-3-540-46245-3
eBook Packages: Computer ScienceComputer Science (R0)