Compressed network coding vectors

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 109-113

  Jafari, Mahdi ^a   Keller, Lorenzo ^a   Fragouli, Christina ^a   Argyraki, Katerina ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CODING VECTORS; IN-NETWORK; INTERMEDIATE NETWORKS; LINEAR COMBINATIONS; NETWORK CODING; OPTIMAL DESIGN;

ENCODING (SYMBOLS); INFORMATION THEORY;

VECTORS;

EID: 70449513716     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5206041     Document Type: Conference Paper

References (18)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow", IEEE Transactions on Information Theory, Volume 46, Issue 4, Page(s) 1204-1216,2000.
2. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding", Allerton Conference on Communication, Control, and Computing, Monticello, IL, October 2003.
3. M. Jafari, S. Mohajer, C. Fragouli and S. Diggavi, "Capacity of noncoherent network coding", IEEE International Symposium on Information Theory, Seoul, Korea, June 2009.
4. R. Koetter and F. Kschischang, "Coding for errors and erasures in random network coding", IEEE Transactions on Information Theory, Volume 54, Issue 8, Page(s) 3579-3591, August 2008.
5. F. J. MacWilliams and N. J. A. Sloane, "The theory of error-correcting codes", North-Holland Mathematical Library, 1977.
6. E. R. Berlekamp, R. J. McEliece, and H. C. van Tilborg, "On the inherent intractability of certain coding problems", IEEE Transactions on Information Theory, Volume 24, Issue 3, May 1978.
7. R. E. Blahut, "Algebraic codes for data transmission", Cambridge University Press, 2003.
8. Edited by V. S. Pless and W. C. Huffman, "Handbook of coding theory", North-Holland Mathematical Library, 1998.
9. E. R. Berlekamp, "Nonbinary BCH decoding", IEEE Transaction of Information Theory, Volume 14, Issue 2, 1968.
10. J. L. Massey, "Shift-Register synthesis and BCH decoding", IEEE Transaction on Information Theory, Volume 15, Issue 1, 1969.
11. N. Patterson, "Algebraic Decoding of Goppa Codes", IEEE Transaction on Information Theory, Volume 21, Issue 2, Page(s) 203-207, 1975.
12. M. Grassl, "Bounds on the minimum distance of linear codes", Online available at http://www.codetables.de, Accessed on 2009-01-09.
13. V. D. Goppa, "A new class of linear error-correcting codes", Probl. Peredach. Inform, Volume 6, Issue 3, Page(s) 24-30, 1970.
14. I. S. Reed and G. Solomon, "Polynomial codes over certain finite field", Journal of the Society for Industrial and Applied Mathematics (SIAM), Volume 8, Page(s) 300-304, 1960.
15. V. D. Goppa, "Codes associated with divisors", Probl. Peredachi Inform., Volume 13, Page(s) 33-39, 1977. Translation: Probl. Inform. Transmission, Volume 13, Page(s) 22-26, 1977.
16. J. Blomer, R. Karp, and E. Welzl, "The Rank of Sparse Random Matrices over Finite Fields", Random Structures Algorithms 10, Page(s) 407-419.
17. P. Pakzad, C. Fragouli, and A. Shokrollahi, "Coding Schemes for Line Networks", IEEE International Symposium on Information Theory, Adelaide, Australia, 2005.
18. Tinyos: http://www.tinyos.net/.