Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions (Q1876077)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions |
scientific article; zbMATH DE number 2091557
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions |
scientific article; zbMATH DE number 2091557 |
Statements
Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions (English)
0 references
16 August 2004
0 references
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)].
0 references
MDR codes
0 references
\(\rho\) metric
0 references
uniform distributions
0 references
