Insert title here
    登录 | 注册 | 期刊登录 | 收藏
 
 高级组合检索
Applicable Algebra in Engineering, Communication and Computing 2006, Vol. 17 (5 ) :315 -335 doi:10.1007/s00200-006-0015-8 <<-上一篇 下一篇 ->>
The Correction Capability of the Berlekamp–Massey–Sakata Algorithm with Majority Voting
Maria Bras-Amorós(1)   Michael E. O’Sullivan(2)   
1.Universitat Autònoma de Barcelona Departament d’Enginyeria de la Informació i de les Comunicacions 08193 Bellaterra Spain 08193 Bellaterra Spain
2.San Diego State University Department of Mathematics and Statistics San Diego CA 92182-7720 USA San Diego CA 92182-7720 USA
Abstract: Sakata’s generalization of the Berlekamp–Massey algorithm applies to a broad class of codes defined by an evaluation map on an order domain. In order to decode up to the minimum distance bound, Sakata’s algorithm must be combined with the majority voting algorithm of Feng, Rao and Duursma. This combined algorithm can often decode far more than (d min −1)/2 errors, provided the errors are in general position. We give a precise characterization of the error correction capability of the combined algorithm. We also extend the concept behind Feng and Rao’s improved codes to decoding of errors in general position. The analysis leads to a new characterization of Arf numerical semigroups.
Keywords:
Insert title here
更多服务: 作者自存档 | 投稿导航 | 全球期刊检索 | 查找审稿人
关于我们 | 隐私申明 | 免责声明 | 意见反馈 | 合作服务
Magsci ©  版权所有
Copyright © 2010 - 2013 Magtech. All Rights Reserved.