Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions (Q1876077)

The authors establish a bound on the minimum \(\rho\) distance for codes in Mat\(_{n,s}(\mathbb{Z}_{k})\) with respect to their ranks and call codes meeting this bound MDR codes. They study weight spectra and duality for these codes. Furthermore the authors extend the relationship between codes in Mat\(_{n,s}(\mathbb{Z}_{k})\) and uniform distributions in the unit cube. This generalizes recent work of \textit{M. M. Skriganov} [St. Petersbg. Math. J. 13, No. 2, 301--337 (2002); translation from Algebra Anal. 13, No. 2, 191--239 (2002; Zbl 0994.11028)].