首页 | 本学科首页   官方微博 | 高级检索  
     


Maximum Distance Separable Codes in the ρ Metric over Arbitrary Alphabets
Authors:Steven T. Dougherty  Maxim M. Skriganov
Affiliation:(1) Department of Mathematics, University of Scranton, Scranton, PA 18510, USA;(2) Steklov Institute of Mathematics at, St. Petersburg, Fontanka 27, St. Petersburg, 191011, Russia
Abstract: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.
Keywords:MDS codes  uniform distributions
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号