On Error Control Codes for Random Network Coding
The random network coding approach is approved to be an effective technique for linear network coding, however is highly susceptible to errors and adversarial attacks. Recently Kötter and Kschischang  introduced the operator channel, where the inputs and outputs are subspaces of a given vector space, showing that this is a natural transmission model in noncoherent random network coding. A suitable metric, defined for subspaces: \(d(U,V)=\dim U+\dim V-2\dim (U\cap V)\), gives rise to the notion of codes capable of correcting (different kinds of) errors in noncoherent random network coding. In this lecture we continue the study of coding for operator channels started in . Bounds and constructions for codes correcting insertions/deletions are presented.
- 2.T. Ho, R. Kötter, M. Medard, D.R. Karger, M. Effros, The benefits of coding over routing in randomized setting, in Proceedings of the 2003 IEEE International Symposium on Information Theory, (Yokohama), June 20–July 3 (2003), p. 442Google Scholar
- 3.P.A. Chou, Y. Wu, K. Jain, Practical network coding, in Proceedings of the 2003 Allerton Conference on Communication Control and Computing, (Monticello, IL) (2003)Google Scholar
- 8.P. Delsarte, An algebraic approach to association schemes of coding theory. Philips J. Res. 10 (1973)Google Scholar
- 12.T. Etzion, A. Vardy, Error-correcting codes in projective spaces, in Proceedings of the IEEE International Symposium on Information Theory, Toronto (2008), pp. 871–875Google Scholar
- 17.D.J. Kleitman, On an extremal property of antichains in partial orders. The LYM property and some of its implications and applications, in Combinatorics, Part 2: Graph Theory; Foundations, Partitions and Combinatorial Geometry. Mathematical Centre tracts, vol. 56 (Mathematisch Centrum, Amsterdam, 1974), pp. 77–90Google Scholar
- 19.T. Etzion, N. Silberstein, Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagram. CoRR (2008), arXiv:0807.4846