Computation of total capacity for discrete memoryless multiple-access channels

@article{Rezaeian2004ComputationOT,
  title={Computation of total capacity for discrete memoryless multiple-access channels},
  author={Mohammad Rezaeian and Alex J. Grant},
  journal={IEEE Transactions on Information Theory},
  year={2004},
  volume={50},
  pages={2779-2784}
}
The Arimoto-Blahut (1972) algorithm is generalized for computation of the total capacity of discrete memoryless multiple-access channels (MAC). In addition, a class of MAC is defined with the property that the uniform distribution achieves the total capacity. These results are based on the specialization of the Kuhn-Tucker condition for the total capacity of the MAC, and an extension of a known symmetry property for single-user channels. 
Highly Cited
This paper has 22 citations. REVIEW CITATIONS