Graph-theoretical constructions for graph entropy and network coding based communications

IEEE Transactions on Information Theory

Volumn 57, Issue 10, 2011, Pages 6703-6717

  Gadouleau, Maximilien ^a   Riis, Søren ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Cyclic codes; guessing games; network coding; network design

Indexed keywords

AMOUNT OF INFORMATION; CYCLIC CODE; DERIVE BOUNDS; DIRECTED GRAPHS; GENERATOR POLYNOMIAL; GRAPH ENTROPY; GUESSING GAMES; INDEPENDENCE NUMBER; INTERMEDIATE NODE; NETWORK DESIGN; UNDIRECTED GRAPH;

ALGEBRA; ENTROPY; GRAPH THEORY; INFORMATION THEORY;

NETWORK CODING;

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

References (33)

1. 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.
2. S.-Y. R. Li, R. W. Yeung, and N. Cai," Linear network coding" IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
3. S. Riis, " Linear versus non-linear boolean functions in network flow" presented at the CISS, Princeton, NJ, Mar. 2004.
4. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow" IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2745-2759, Aug. 2005.
5. R. Kötter and M. Ḿdard, "An algebraic approach to network coding" IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
6. T. Ho, M. Médard, R. Kötter, D. R. Karger, M. Effros, J. Shi, and B. Leong," A random linear network coding approach to multicast" IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006.
7. R. Dougherty, C. Freiling, and K. Zeger, "Unachievability of network coding capacity" IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2365-2372, Jun. 2006.
8. S. Riis, Graph Entropy, Network Coding and Guessing Games, Nov. 2007 [Online]. Available: http://arxiv.org/abs/0711.4175
9. S. Riis, "Utilising public information in network coding" General Theory of Information Transfer and Combinatorics, pp. 866-897, 2006.
10. R. Dougherty and K. Zeger, "Nonreversibility and equivalent constructions of multiple unicast networks" IEEE Trans. Inf. Theory, vol. 52, no. 11, pp. 1287-1291, Nov. 2006.
11. S. Riis, "Information flows, graphs and their guessing numbers" Electron. J. Combin., vol. 14, no. R44, pp. 1-17, 2007.
12. T. Wu, P. Cameron, and S. Riis, "On the guessing number of shift graphs" J. Discrete Alg., vol. 7, pp. 220-226, 2009.
13. Z. Zhang and R. W. Yeung, "A non-Shannon-type conditional inequality of information quantities" IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 1982-1986, Nov. 1997.
14. Z. Zhang and R. W. Yeung, "On characterization of entropy function via information inequalities" IEEE Trans. Inf. Theory, vol. 44, no. 4, pp. 1440-1452, Jul. 1998.
15. R. Dougherty, C. Freiling, and K. Zeger, "Networks, matroids, and non- Shannon information inequalities" IEEE Trans. Inf. Theory, vol. 53, no. 6, pp. 1949-1969, Jun. 2007.
16. Y. Sun, "Network Coding and Graph Entropy" Ph.D. dissertation, Queen Mary, Univ. London, London, U.K., Sep. 2009.
17. J. Körner, "Coding of an information source having ambiguous alphabet and the entropy of graphs" in Proc. 6th Prague Conf. Information Theory, Statistical Decision Function, Random Processes, Prague, 1971, pp. 411-425.
18. G. Simonyi, "Graph entropy: A survey" in Combinatorial Optimization, ser. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Providence, RI: AMS, 1995, vol. 20, pp. 399-441.
19. S. E. Rouayheb, A. Sprintson, and C. Georghiades, "On the index coding problem and its relation to network coding and matroid theory" IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3187-3195, Jul. 2010.
20. S. Riis and R. Ahlswede, "Problems in network coding and error-correcting codes" in Proc. NetCod, Riva del Garda, Italy, Apr. 2005.
21. C. Caramanis, M. Rosenblum, M. X. Goemans, and V. Tarokh, "Scheduling algorithms for providing flexible, rate-based, quality of service guarantees for packet-switching in Banyan networks" presented at the CISS, Princeton, NJ, 2004.
22. J. K. Sundararajan, M. Médard, R. Koetter, and E. Erez, "A systematic approach to network coding problems using conflict graphs" in Proc. UCSD Workshop on Information Theory and Applications (in ), La Jolla, CA, Feb. 2006, pp. 1-5.
23. D. Traskov, M. Heindlmaier, N. Médard, R. Koetter, and D. S. Lun," Scheduling for network coded multicast: A conflict graph formulation" in Proc. Globecom Workshops, New Orleans, LA, Nov.-Dec. 2008, pp. 1-5.
24. C. D. Godsil and G. Royle, Algebraic Graph Theory, ser. Graduate Texts in Mathematics. New York: Springer-Verlag, 2001, vol. 207.
25. J. Harant and I. Schiermeyer, "On the independence number of a graph in terms of order and size" Discrete Math., vol. 232, pp. 131-138, 2001.
26. L. Lovász, "On the ratio of optimal integral and fractional covers" Discrete Math., vol. 13, pp. 383-390, 1975.
27. M. O. Albertson and K. L. Collins, "Homomorphisms of 3-chromatic graphs" Discrete Math., vol. 54, pp. 127-132, 1985.
28. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
29. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, "A new table of constant weight codes" IEEE Trans. Inf. Theory, vol. 36, no. 6, pp. 1334-1380, Nov. 1990
30. E. Agrell, A. Vardy, and K. Zeger, "Upper bounds for constant-weight codes" IEEE Trans. Inf. Theory, vol. 46, no. 7, pp. 2373-2395, Nov. 2000.
31. S. M. Johnson, "A new upper bound for error-correcting codes" IRE Trans. Inf. Theory, vol. 8, no. 3, pp. 203-207, Apr. 1962.
32. L. Babai, "Automorphism groups, isomorphism, reconstruction" in Handbook of Combinatorics, 1994.
33. R. Dougherty, C. Freiling, and K. Zeger, "Linearity and solvability in multicast networks" IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2243-2256, Oct. 2004.