Scaling laws for line networks: From zero-error to min-cut capacity

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 1698-1702

  Niesen, Urs ^a   Fragouli, Christina ^b   Tuninetti, Daniela ^c  

^a Architecture Machine Group

^b EPFL   (Switzerland)

^c UIC ^*

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY COMPLEXITY; DISCRETE MEMORYLESS CHANNELS (DMC); MIN-CUT CAPACITY; ZERO-ERROR CODE;

ALGORITHMS; CHANNEL CAPACITY; CHANNEL CODING; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS;

WIRELESS NETWORKS;

EID: 39049131170     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261644     Document Type: Conference Paper

References (8)

1. T. Cover, J. Thomas, "Elements of Information Theory," Wiley Series, 1991.
2. U. Niesen, C. Fragouli, D. Tuninetti, "On the Capacity of an Infinite Cascade of Channels", Allerton 2005, Monticello, IL (USA) Sept. 2005.
3. D. Tuninetti, C. Fragouli, "Processing along the way: forwarding vs. coding", ISITA 2004, Parma (Italy) Oct. 2004.
4. P. Gupta, P. R. Kumar, "The Capacity of Wireless Networks", IEEE Trans. on Info. Theory, Vol. 46(2), March 2000.
5. C. E. Shannon, "The Zero Error Capacity of a Noisy Channel", IEEE Trans, on Info. Theory, Vol. 2(3), Sept. 1956.
6. U. Niesen, C. Fragouli, D. Tuninetti, "On Capacity of Line Networks", submitted to IEEE Trans, on Info. Theory on Dec. 2005.
7. C. E. Shannon, "Some Geometrical Results in Channel Capacity", Nachrichtentechnische Zeitschrift, Vol.10, 1957.
8. V. Vazirani, "Approximation Algorithms", Springer, 2001.