On the Density of Codes over Finite Chain Rings

We determine the asymptotic proportion (or density) of free modules over finite chain rings with good distance properties and treat the asymptotics in the code length n and the residue field size q separately. We then specialize and apply our technique to rank metric codes and to Hamming metric codes.