Computer Science – Information Theory
Scientific paper
2009-01-24
Computer Science
Information Theory
In preparation for IEEE Transactions on IT
Scientific paper
The randomized fixe-composition with optimal decoding error exponents are studied \cite{Raul_ISIT,Raul_journal} for the finite alphabet interference channel (IFC) with two transmitter-receiver pairs. In this paper we investigate the capacity region of the randomized fixed-composition coding scheme. A complete characterization of the capacity region of the said coding scheme is given. The inner bound is derived by showing the existence of a positive error exponent within the capacity region. A simple universal decoding rule is given. The tight outer bound is derived by extending a technique first developed in \cite{Dueck_RC} for single input output channels to interference channels. It is shown that even with a sophisticated time-sharing scheme among randomized fixed-composition codes, the capacity region of the randomized fixed-composition coding is not bigger than the known Han-Kobayashi \cite{Han_Kobayashi} capacity region. This suggests that the average behavior of random codes are not sufficient to get new capacity regions.
No associations
LandOfFree
Interference channel capacity region for randomized fixed-composition codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Interference channel capacity region for randomized fixed-composition codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interference channel capacity region for randomized fixed-composition codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-454341