Rank-metric codes are codes whose each codeword is a matrix and the distance between two codewords is the rank of their difference.They were introduced in 1978 by Philippe Delsarte. In 1985, Ernst M. Gabidulin proposed a decoding algorithm for a family of maximum rank distance codes. Rank-metric codes over finite fields are used in space-time coding, public-key cryptosystems, and random linear network coding. But, in 2011, Feng et al. gave some advantages of using finite chain rings in network coding. So, in 2019, Kamche and Mouaha generalized to finite commutative principal ideal rings some classical results of rank- metric codes. In this talk, we will give some advantages of rank-metric codes over finite rings in network coding and cryptography.