On error control codes for random network coding

2009 Workshop on Network Coding, Theory and Applications, NetCod '09

Volumn , Issue , 2009, Pages 68-73

  Ahlswede, R ^a   Aydinian, H ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIMENSION REDUCTION; ERROR CONTROL CODE; LINEAR NETWORK CODING; NON-COHERENT; PACKET ERRORS; RANDOM NETWORK CODING; TRANSMISSION MODEL;

COMMUNICATION CHANNELS (INFORMATION THEORY); RANDOM ERRORS; TECHNICAL PRESENTATIONS; VECTOR SPACES;

CODING ERRORS;

EID: 77950841738     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NETCOD.2009.5191396     Document Type: Conference Paper

References (22)

1. R. Ahlswede, H. Aydinian, and L.H. Khachatrian, On perfect codes and related concepts, Des. Codes Cryptogr., vol. 22, no. 3, 221-237, 2001. (Pubitemid 33690780)
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, Network information flow, IEEE Info. Theory, vol. 46, no. 4, pp. 1024-1016, 2000.
3. A.E. Brouwer, A.M. Cohen, and A. Neumaier, Distance regular graphs, Springer-Verlag, Berlin Heidelberg, 1989.
4. N. Cai and R. W. Yeung, Network error correction, Part II: Lower bounds, Communications in Information and Systems, vol. 6, no. 1, 37-54, 2006.
5. Chou, Wu, and Jain, Practical network coding, in Proc. 2003 Allerton Conf. on Commun., Control and Computing, (Monticello, IL), Oct. 2003.
6. Ph. Delsarte, An algebraic approach to associated schemes of coding theory, Philips J. Res., vol. 10, 1-97, 1973.
7. T. Etzion and N. Silberstein, Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagram, CoRR, vol. abs/0807.4846, Oct. 2008.
8. T. Etzion and A. Vardy, Error-correcting codes in projective spaces, in Proc. IEEE Int. Symp. Info. Theory, Toronto, July 2008, pp. 871-875.
9. P. Frankl and R. Wilson, The Erdos-Ko-Rado theorem for vector spaces, J. Combin. Theory A, vol. 43, 228-236, 1986.
10. E.M. Gabidulin, Theory of codes with maximum rank distance, Problems Info. Transmission, vol. 21, no. 1, 1-12, 1985.
11. T. Ho, R. Kötter, M. Medard, D.R. Karger, and M. Effros, The benefits of coding over routing in randomized setting, Proc. 2003 IEEE Int. Symp. on Inform. Theory, (Yokohama) p. 442, June 20-July 3, 2003.
12. T. Ho, M. Medard, R. Kötter, D.R. Karger, M. Effros, J. Shi, and B. Leong, A Random Linear Network Coding Approach to Multicast, IEEE Trans. on Info. Theory, vol. 52, no. 10, 4413-4430, 2006. (Pubitemid 46445282)
13. D.J. Kleitman, On an extremal property of antichains in partial orders. The LYM property and some of its implications and applications. Combinatorics, Part 2: Graph theory; foundations, partitions and combinatorial geometry, pp. 77-90. Math. Centre Tracts, No. 56, Math. Centrum, Amsterdam, 1974.
14. R. Koetter and F.R. Kschischang, Coding for Errors and Erasures in Random Network Coding, IEEE Trans. Info. Theory, vol. 54, no. 8, 3579-3591, 2008.
15. S.-Y. R. Li, R. W. Yeung, and N. Cai, Linear network coding, IEEE Trans. Info. Theory, vol. 49, no. 2, 371-381, 2003.
16. F.J. MacWilliams and N.J. Sloane, The Theory of Error-Correcting Codes, New York: North-Holland, 1988.
17. M. Schwartz and T. Etzion, Codes and anticodes in the Grassman graph, J. Combin. Theory Ser. A 97, no. 1, 27-42, 2002.
18. D. Silva, F.R. Kschischang, and R. Koetter, A Rank-Metric Approach to Error Control in Random Network Coding, IEEE Trans. Info. Theory, vol. 54, no. 9, 3951-3967, 2008.
19. H. Wang, C. Xing, and R. Safavi-Naimi, Linear authentification codes: bounds and constructions, IEEE Trans. Info. Theory, vol. 49, 866-872, 2003.
20. S-T. Xia and F-W Fu, Johnson type bounds on constant dimension codes, Des. Codes Cryptogr., vol. 50,163-172, 2009.
21. R. W Yeung and N. Cai, Network error correction, Part I: Basic concepts and upper bounds, Communications in Information and Systems, vol. 6, no. 1, 19-36, 2006.
22. R. W. Yeung, S.-Y. R. Li, N. Cai, and Z. Zhang, Network Coding Theory, now Publishers, 2005.