Maximum Distance Codes in Matn,s (Zk) with a Non-Hamming Metric and Uniform Distributions

Authors:
Steven T. Dougherty;Keisuke Shiromoto
Affiliations:
Department of Mathematics, University of Scranton, Scranton, PA 18510, U.S.A. doughertys1@uofs.edu;Department of Mathematics, Kumamoto University, 2-39-1, Kurokami, Kumamoto 860–8555, Japan
Venue:
Designs, Codes and Cryptography
Year:
2004

Citing 2
Cited 2

Maximum Distance Separable Codes in the ρ Metric over Arbitrary Alphabets

Journal of Algebraic Combinatorics: An International Journal
MDR codes over Zk

IEEE Transactions on Information Theory

Linear Codes over $\mathbb{F}_{q}[u]/(u^s)$ with Respect to the Rosenbloom---Tsfasman Metric

Designs, Codes and Cryptography
On universally decodable matrices for space---time coding

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We establish a bound on the minimum ρ distance for codes in Matn,s (Zk) with respect to their ranks and call codes meeting this bound MDR codes. We extend the relationship between codes in Matn,s (Zk) and distributions in the unit cube and use the Chinese Remainder Theorem to construct codes and distributions.