Talk by Hermann Tchatchiem Kamche
Date: 19.10.22 Time: 16.30 - 17.30 Room:
Rank-metric codes are codes for which each codeword is a matrix and the distance between two codewords is the rank of their difference. Rank-metric codes over finite fields are used in space-time coding, public-key cryptosystems, and random linear network coding. Works on nested-lattice-based network coding suggest the construction of more efficient physical-layer network coding schemes with network coding over finite chain rings. So, finite rings can be used in network coding, but how to detect and correct errors.
In this talk, we present the generalization of some results in rank-metric codes to finite commutative principal ideal rings. These results are then applied in network coding as in the case of finite fields. Specifically, two existing encoding schemes of random linear network coding are combined to improve the error correction.
(**This eSeminar will also be live-streamed on Zoom, using the same meeting details as previous seminars. If you do not have meeting details, please contact firstname.lastname@example.org **)