A Unified Random Coding Bound

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 64
  • Download : 0
In this paper, we prove a unified achievability bound that generalizes and improves random coding bounds for any combination of source coding, channel coding, joint source-channel coding, and coding for computing problems assuming blockwise node operation. As a general network setup, we consider an acyclic discrete memoryless network, where the network demands and constraints are specified by a joint-typicality constraint on the whole channel input and output sequences. For achievability, a basic building block for node operation consists of simultaneous nonunique decoding, simultaneous compression, and symbol-by-symbol mapping. Our hound can be useful for deriving random coding bounds without error analysis, especially for large and complex networks. In particular, our hound can be used for unifying and generalizing many known relaying strategies. For example, a generalized decode-compressamplify-and-forward bound is obtained as a simple corollary of our main theorem, and it is shown to strictly outperform the previously known relaying schemes. Furthermore, by exploiting the symmetry in our bound, we formally define and characterize three types of network duality based on channel input-output reversal and network flow reversal combined with packing-covering duality.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2018-10
Language
English
Article Type
Article
Keywords

ARBITRARILY CORRELATED SOURCES; MEMORYLESS BROADCAST CHANNEL; NETWORK INFORMATION-FLOW; ACHIEVABLE RATE REGION; RELAY NETWORKS; SIDE INFORMATION; MULTIPLE DESCRIPTIONS; INTERFERENCE CHANNEL; CAPACITY THEOREMS; DUALITY

Citation

IEEE TRANSACTIONS ON INFORMATION THEORY, v.64, no.10, pp.6779 - 6802

ISSN
0018-9448
DOI
10.1109/TIT.2018.2864731
URI
http://hdl.handle.net/10203/246025
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0