Computer Science – Information Theory
Scientific paper
2011-07-23
Computer Science
Information Theory
Scientific paper
Random coding, along with various standard techniques such as coded time-sharing, rate-splitting, superposition coding, and binning, are traditionally used in obtaining achievable rate regions for multi-terminal networks. The error analysis of such an achievable scheme relies heavily on the properties of strongly joint typical sequences and on bounds of the cardinality of typical sets. In this work, we obtain an achievable rate region for a general (i.e. an arbitrary set of messages shared amongst encoding nodes, which transmit to arbitrary decoding nodes) memoryless, single-hop, multi-terminal network without feedback or cooperation by introducing a general framework and notation, and carefully generalizing the derivation of the error analysis. We show that this general inner bound may be obtained from a graph representation that captures the statistical relationship among codewords and allows one to readily obtain the rate bounds that define the achievable rate region. The proposed graph representation naturally leads to the derivation of all the achievable schemes that can be generated by combining classic random coding techniques for any memoryless network used without feedback or cooperation.
No associations
LandOfFree
An Achievable Region for a General Multi-terminal Network and its Chain Graph Representation 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 An Achievable Region for a General Multi-terminal Network and its Chain Graph Representation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Achievable Region for a General Multi-terminal Network and its Chain Graph Representation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-668706