Partial Spread Codes
Vortrag von Prof. Dr. Alberto Ravagnani
Datum: 13.05.13 Zeit: 12.00 - 13.00 Raum:
In this talk partial spreads of classical projective geometry are employed to construct network codes of asymptotically optimal parameters. We call such codes "partial spread codes". Thanks to a convenient description in terms of block-matrices, we explicitly construct maximal partial spread codes with respect to containment, and provide an efficient algorithm to decode them. Partial spreads naturally generalize the well-known family of spread codes, which are obtained from partial spread codes for special choices of the parameters.References:
1) R. Kötter, F. R. Kschischang, Coding for Errors and Erasures in Random Network Coding. IEEE Transactions on Information Theory, 54(8), pp. 3579 - 3591 (2008).
2) F. Manganiello, E. Gorla, J. Rosenthal, Spread Codes and Spread Decoding in Network Coding. IEEE Proceedings 2008, Toronto, pp. 881 - 885.
3) E. Gorla, F. Manganiello, J. Rosenthal, An Algebraic Approach for Decoding Spread Codes. Advances in Mathematics of Communications, 6, no. 4, pp. 443 - 466 (2012).