A new subclass of alternant codes can meet the Gilbert-Varshamov bound

被引：0
作者：
Fan, Ji-Hao [1 ]
Chen, Han-Wu [1 ,2 ]
机构：
[1] School of Computer Science and Engineering College of Software Engineering, Southeast University, Nanjing, 211189, Jiangsu
[2] Key Laboratory of Computer Network and Information Integration, Southeast University, Ministry of Education, Nanjing, 211189, Jiangsu
来源：
Tien Tzu Hsueh Pao/Acta Electronica Sinica | 2015年 / 43卷 / 11期
关键词：
Alternant codes; BCH codes; Gilbert-varshamov bound; Hamming weight distribution; Maximum distance separable(MDS) codes;
D O I：
10.3969/j.issn.0372-2112.2015.11.016
中图分类号：
学科分类号：
摘要：
A new subclass of binary Alternant codes is proposed based on the Hamming weight distribution of Maximum Distance Separable(MDS) codes. It is shown that the new codes include the whole BCH codes subclass and can asymptotically meet the Gilbert-Varshamov(GV) bound. © 2015, Chinese Institute of Electronics. All right reserved.
引用
收藏
页码：2243 / 2246
页数：3
相关论文
共 5 条
  • [1] MacWilliams F.J., Sloane N.J.A., The Theory of Error-Correcting Codes, pp. 1-369, (1981)
  • [2] Feng K., The Algebraic Theory of Error-Correcting Codes, pp. 1-80, (2005)
  • [3] Berlekamp E., Goppa codes, IEEE Transactions on Information Theory, 19, 5, pp. 590-592, (1973)
  • [4] Martinez-Perez C., Willems W., Is the class of cyclic codes asymptotically good?, IEEE Transactions on Information Theory, 52, 2, pp. 696-700, (2006)
  • [5] Ezerman M.F., Grassl M., Sole P., The weights in MDS codes, IEEE Transactions on Information Theory, 57, 1, pp. 392-396, (2011)
1