Maximum Distance Separable Codes in the ρ Metric over Arbitrary Alphabets

被引：0
|
作者：
Steven T. Dougherty
Maxim M. Skriganov
机构：
[1] University of Scranton,Department of Mathematics
[2] Steklov Institute of Mathematics at,undefined
来源：
Journal of Algebraic Combinatorics | 2002年 / 16卷
关键词：
MDS codes; uniform distributions;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We give a bound for codes over an arbitrary alphabet in a non-Hamming metric and define MDS codes as codes meeting this bound. We show that MDS codes are precisely those codes that are uniformly distributed and show that their weight enumerators based on this metric are uniquely determined.
引用
收藏
页码：71 / 81
页数：10
相关论文
共 50 条
12345