Normalized entropy vectors, network information theory and convex optimization

Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, ITW

Volumn , Issue , 2007, Pages 143-147

  Hassibi, Babak ^a   Shadbakht, Sormeh ^a  

^a California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENTROPY; INFORMATION THEORY; METROPOLITAN AREA NETWORKS; OPTIMIZATION; SET THEORY; TECHNICAL PRESENTATIONS; VECTORS;

ALPHABET SIZES; ARBITRARY SETS; CAPACITY REGIONS; CONVEX OPTIMIZATIONS; CONVEX SETS; CUTSET BOUNDS; DUALITY ARGUMENTS; LINEAR CONSTRAINTS; LINEAR FUNCTIONS; MEMORYLESS CHANNELS; NETWORK CODING; NETWORK INFORMATION THEORIES; NON CONVEXITIES; SOURCES AND DESTINATIONS; STANDARD DEFINITIONS; WIRED NETWORKS;

WIRELESS NETWORKS;

EID: 47849102473     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITWITWN.2007.4318051     Document Type: Conference Paper

References (11)

1. C.E. Shannon, "Two-way communications channels," in Proceedings of the 4th Berkeley Symposium on Mathematical Staistics and Probabililty. University of California Press, 1961, pp. 611-644.
2. R. Ahlswede, "A survey of multi-way channels in information theory: 1961-1976," IEEE Transactions on Information Theory, vol. 23, pp. 1-37, January 1977.
3. G. Kramer, "Capacity results for the discrete memoryless network," IEEE Transactions on Information Theory, vol. 49, pp. 4-21, January 2003.
4. R.S. Cheng and S. Verdu, "On limiting characterizations of memoryless multiuser capacity regions," IEEE Transactions on Information Theory, vol. 39, pp. 609-612, March 1993.
5. R.W. Yeung, A first course in information theory, Kluwer, 2002.
6. F. Matus, "Infinitely many information inequalities," in Submitted to ISIT, 2007.
7. Zhen Zhang and Raymond Yeung, "A non-shannon-type conditional inequality of information quantities," IEEE Trans. on Information Theory, vol. 43, no. 6, pp. 1982-1986, 1997.
8. P. Elia, A. Feinstein, and C.E. Shannon, "Note on maximum flow through a network," IRE Transactions on Information Theory, vol. 2, pp. 117-119, 1956.
9. L.R. Ford and D.R. Fulkerson, "Maximal flow through a network," Canadien Journal of Mathematics, vol. 8, pp. 399-404, 1956.
10. T.M. Cover and J.A. Thomas, Elements of Information Theory, John Wiley & Sons, Inc., 1991.
11. R. Koetter, "Separation for source, channel and network coding," in IEEE Information Theory Workshop - Keynote Speech, 2006.