On capacity of line networks

IEEE Transactions on Information Theory

Volumn 53, Issue 11, 2007, Pages 4039-4058

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

^a USA   (United States)

^b EPFL   (Switzerland)

^c 1120 Science and Engineering Offices   (United States)

Author keywords

Capacity; Network coding; Zero error capacity

Indexed keywords

CHANNEL CAPACITY; SIGNAL ENCODING; TELECOMMUNICATION LINKS;

DISCRETE MEMORYLESS CHANNELS; NETWORK CODING; ZERO-ERROR CAPACITY;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 36348969604     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.907513     Document Type: Article

References (33)

1. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
3. S.-Y. R. Li, R. W. Yeung, and N. Caj, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
4. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proc. 15th ACM Symp. Parallel Algorithms and Architectures, San Diego, CA, Jun. 2003, pp. 286-294.
5. R. Koetter and M. Médard, "Beyond routing: An algebraic approach to network coding," in Proc. IEEE INFOCOM, New York, Jun. 2002, vol. 1, pp. 122-130.
6. C. Fragouli and E. Soljanin, "Information flow decomposition for network coding," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 829-848, Mar. 2006.
7. C. E. Shannon, "The zero error capacity of a noisy channel," IEEE Trans. Inf. Theory, vol. IT-2, no. 3, pp. 8-19, Sep. 1956.
8. P. Gupta and P. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
9. M. K. Simon, "On the capacity of a cascade of identical discrete memoryless nonsingular channels," IEEE Trans. Inf. Theory, vol. IT- 16, no. 1, pp. 100-102, Jan. 1970.
10. R. A. Silverman, "On binary channels and their cascade," IEEE Trans. Inf. Theory, vol. IT-1, no. 3, pp. 19-27, Dec. 1955.
11. A. B. Kiely and J. T. Coffey, "On the capacity of a cascade of channels," IEEE Trans. Inf. Theory, vol. 39, no. 4, pp. 1310-1321, Jul. 1993.
12. D. Lun, M. Médard, and M. Effros, "On coding for reliable communication over packet networks," in Proc. 42nd Annu. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2004.
13. P. Pakzad, C. Fragouli, and A. Shokrollahi, "Coding schemes for line networks," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 1853-1857.
14. U. Niesen, C. Fragouli, and D. Tuninetti, "On the capacity of an infinite cascade of channels," in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sep. 2005.
15. J. Körner and A. Orlitsky, "Zero-error information theory," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2207-2229, Oct. 1998.
16. E. Seneta, Non-Negative Matrices and Markov Chains. New York: Springer-Verlag, 1981.
17. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985.
18. R. A. Horn and C. R. Johnson, Topics in Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1991.
19. C. E. Shannon, "Some geometrical results in channel capacity," Nachrichtentechnische Z., vol. 10, pp. 1-4, Jan. 1957.
20. R. T. Rockafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1996.
21. M. Saks and A. Condon, "A limit theorem for sets of stochastic matrices," Linear Algebra and Applications, vol. 381, pp. 61-76, 2004.
22. P. Gács and J. Körner, "Common information is far less than mutual information," Probl. Contr. Inf. Theory, vol. 2, no. 2, pp. 149-162, 1973.
23. S. Wolf and J. Wullschleger, "Zero-error information and applications in cryptography," in Proc. IEEE Inf. Theory Workshop, San Antonio, TX, Oct. 2004, pp. 1-6.
24. R. Renner, S. Wolf, and J. Wullschleger, "'The single-serving channel capacity," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 1424-1427.
25. L. Lovász, "On the Shannon capacity of a graph," IEEE Trans. Inf. Theory, vol. IT-25, no. 1, pp. 1-7, Jan. 1979.
26. V. Vazirani, Approximation Algorithms. New York: Springer-Verlag, 2001.
27. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
28. D. Tuninetti and C. Fragouli, "On the throughput improvement due to limited complexity processing at relay nodes," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 1081-1085.
29. D. Tuninetti, U. Niesen, and C. Fragouli, "On capacity of line networks," in Proc, ITA 2006, San Diego, CA, Jan. 2006 [Online]. Available: http://ita.ucsd.edu/workshop/06/talks/Papers/157.pdf
30. W. Rudin, Principles of Mathematical Analysis. New York: McGraw-Hill, 1976.
31. M. Chiang and S. Boyd, "Geometric programming duals of channel capacity and rate distortion," IEEE Trans. Inf. Theory, vol. 50, no. 2, pp. 245-258, Feb. 2004.
32. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
33. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.