| M. Bierbaum and H. M. Wallmeier, "A note on the capacity region of the multi-access channel, " IEEE Trans. Inform. Theory, vol. IT-25, pg. 484, July 1979. |
....proved by Ahlswede [3] and Liao [4] and subsequently, as a special case of a more general result, by Slepian and Wolf [5] In many instances C is already convex and, hence, the synchronous and the asynchronous capacity region coincide. Nevertheless, there are channels where this is not the case [6]. For a fixed input distribution Q M i=1 p X i , there are points 2 in R that are known to be achievable by a method called single user coding. These are the points R which, after a possible re indexing, fulfill R i I(X i ; Y jX [i Gamma1] i 2 [M ] 5) Such rate tuples R can be achieved as ....
M. Bierbaum and H. M. Wallmeier, "A note on the capacity region of the multi-access channel," IEEE Trans. Inform. Theory, vol. IT--25, p. 484, July 1979.
No context found.
M. Bierbaum and H. M. Wallmeier, "A note on the capacity region of the multi-access channel, " IEEE Trans. Inform. Theory, vol. IT-25, pg. 484, July 1979.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC