DocumentCode :
169257
Title :
A few meta-theorems in network information theory
Author :
Yu Xiang ; Young-Han Kim
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of California, San Diego, La Jolla, CA, USA
fYear :
2014
fDate :
2-5 Nov. 2014
Firstpage :
77
Lastpage :
81
Abstract :
This paper reviews the relationship among several notions of capacity regions of a general discrete memoryless network under different code classes and performance criteria, such as average vs. maximal or block vs. bit error probabilities and deterministic vs. randomized codes. Applications of these meta-theorems include several structural results on capacity regions and a simple proof of the network equivalence theorem.
Keywords :
codes; error statistics; bit error probabilities; capacity regions; code classes; deterministic codes; general discrete memoryless network; meta-theorems; network equivalence theorem; network information theory; performance criteria; randomized codes; Capacity planning; Channel coding; Decoding; Digital TV; Error probability; Manganese; Monte Carlo methods;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop (ITW), 2014 IEEE
Conference_Location :
Hobart, TAS
ISSN :
1662-9019
Type :
conf
DOI :
10.1109/ITW.2014.6970796
Filename :
6970796
Link To Document :
بازگشت