A binary coding approach for combination networks and general erasure networks

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 786-790

  Xiao, Ming ^a   Médard, Muriel ^b   Aulin, Tor ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODE BLOCKING; INTERNATIONAL SYMPOSIUM; MIN-CUT;

BINARY CODES; COMPUTER NETWORKS; CYBERNETICS; ENCODING (SYMBOLS); INFORMATION THEORY; MATRIX ALGEBRA; PROGRAMMING THEORY; SIGNAL ENCODING; TECHNICAL PRESENTATIONS; TRANSFER MATRIX METHOD;

CODES (SYMBOLS);

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

References (18)

1. C. K. Ngai, and R. W. Yeung, "Network Coding Gain of Combination Networks," In Proc. IEEE Info. Theory Workshop, pp. 283-287, San Antonio, USA, Oct. 2004.
2. Z. Li, B. Li, and L. Lau, "On Achieving Maximum Multicast Throughput in Undirected Networks," IEEE Trans. on Inform. Theory, vol. 52, pp. 2467-2485, June 2006.
3. R. W. Yeung, S. Y. R. Li, N. Cai, and Z. Zhang, "Network Coding Theory," Foundation and Trends in Communications and Information Theory, now Publishers, Hanover, MA. USA, 2006.
4. R. Thornburgh, and B. Schoenborn, Storage Area Networks, Prentice Hall, 2001.
5. A. Rasala-Lehman, Network Coding, Ph.D thesis, MIT, Feb. 2005.
6. C. Chekuri, C. Fragouli, and E. Soljanin, "On average throughput and alphabet size in network coding," IEEE Trans. on Inform. Theory, pp. 2410 - 2424, June 2006.
7. C. Fragouli, and E. Soljanin, "Information Flow Decomposition for Network Coding," IEEE Trans. on Inform. Theory, Mar. 2006.
8. R. Ahlswede, N. Cai, S.-Y R. Li and R. W. Yeung, "Network information flow," IEEE Trans. on Inform. Theory, pp. 2410-2424, June 2006.
9. S. Li, R. W. Yeung and N. Cai, "Linear network coding," IEEE Trans. on Inform. Theory, vol. 49, pp. 371-381, Feb. 2003.
10. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. on Networking, vol. 11, pp. 782-795, Oct. 2003.
11. S. Jaggi, Y. Cassuto, and M. Effros, "Low Complexity Encoding for Network Codes," In Proc. IEEE Int. Sym. on Info. Theory, July 2006.
12. S. Lin, and D. Costello, Jr. Error Control Coding, Prentice Hall, 2004.
13. H. Fujita, and K. Sakaniwa, "Some Classes of Quasi-Cyclic LDPC Codes: Properties and Efficient Encoding Method," IEICE Trans. on Fundamentals, vol. E88-A, No. 12, Dec. 2005.
14. W. Tan, and J. Cruz, "Array Codes for Erasure Correction in Magnetic Recording Channels," IEEE Trans. on Magnetics, vol. 39, Sep. 2003.
15. M. Blaum, J. Brack, and A. Vardy, "MDS Array Codes with Independent Parity Symbols," IEEE Trans. on Info. Theory, vol. 42, No. 2, Mar. 1996.
16. D. Wiedemann, "Solving Sparse Linear Equations Over Finite Fields," IEEE Trans. on Info. Theory, vol. 32, No. 1, Jan. 1986.
17. J. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A Digital Fountain Approach to Reliable Distribution of Bulk Data," In Proc. ACM Sigcomm' 98, pp. 56-67, Vancouver, Canada, Sep. 1998.
18. M. Mitzenmacher, "Digital Fountains: A Survey and Look Forward," In Proc. IEEE Info. Theory Workshop, San Antonio, USA, Oct. 2004.