Bounds of E-capacity for multiple-access channel with random parameter

Authors:
M. E. Haroutunian
Affiliations:
-
Venue:
General Theory of Information Transfer and Combinatorics
Year:
2006

Citing 6
Cited 1

Random coding bound and codes produced by permutations for the multiple-access channel

IEEE Transactions on Information Theory
Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
A new universal random coding bound for the multiple-access channel

IEEE Transactions on Information Theory
Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true

IEEE Transactions on Information Theory
Arbitrarily varying multiple-access channels. II. Correlated senders' side information, correlated messages, and ambiguous transmission

IEEE Transactions on Information Theory
Capacities of time-varying multiple-access channels with side information

IEEE Transactions on Information Theory

Reliability criteria in information theory and in statistical hypothesis testing

Foundations and Trends in Communications and Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.