Coding Theory - Advances and Applications in Informatics, Data Analysis, and Cryptography, Jonathan Blackledge,A.F.M. Shahen Shah, Editör, IntechOpen, London, ss.1-13, 2025
Rank metric codes have applications in network coding, post-quantum cryptography, and distributed storage systems. We review the basics of rank metric codes and then summarize the cases where the distance/weight distributions are determined by the basic parameters. The distance distributions of maximum rank distance (MRD) and dually quasi-MRD codes are obtained by their basic parameters. Weight distributions of codes enable us to obtain information on their decoding error probabilities. In this chapter, we obtain the expressions of expectations of the distance and weight distributions of random rank metric codes. Using these expectations we obtain estimations for the expected decoding error probabilities of random codes, both in general and linear cases.