| 一类新的能够渐进达到Gilbert-Varshamov界的Alternant子类码 |
| |
| 引用本文： | 樊继豪,陈汉武.一类新的能够渐进达到Gilbert-Varshamov界的Alternant子类码[J].电子学报,2015,43(11):2243-2246. |
| |
| 作者姓名： | 樊继豪 陈汉武 |
| |
| 作者单位： | 1. 东南大学计算机科学与工程学院, 江苏 南京 211189;
2. 东南大学计算机网络和信息集成教育部重点实验室, 江苏 南京 211189 |
| |
| 摘 要： | 本文基于Maximum Distance Separable(MDS)码的Hamming重量分布提出一类新的二元Alternant子类码.分析表明这类新的子类码包含整个BCH码类,并且可以渐进达到Gilbert-Varshamov(GV)界.
|
| 关 键 词： | Alternant码 BCH码 Gilbert-Varshamov界 Hamming重量分布 Maximum Distance Separable(MDS)码 |
| 收稿时间： | 2014-06-19 |
A New Subclass of Alternant Codes Can Meet the Gilbert-Varshamov Bound |
| |
| FAN Ji-hao,CHEN Han-wu.A New Subclass of Alternant Codes Can Meet the Gilbert-Varshamov Bound[J].Acta Electronica Sinica,2015,43(11):2243-2246. |
| |
| Authors: | FAN Ji-hao CHEN Han-wu |
| |
| Institution: | 1. School of Computer Science and Engineering College of Software Engineering, Southeast University, Nanjing, Jiangsu 211189, China;
2. Key Laboratory of Computer Network and Information Integration, Southeast University, Ministry of Education, Nanjing, Jiangsu 211189, China |
| |
| Abstract: | 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. |
| |
| Keywords: | Alternant codes BCH codes Gilbert-varshamov bound Hamming weight distribution Maximum distance separable(MDS) codes |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《电子学报》浏览原始摘要信息 |
| 点击此处可从《电子学报》下载免费的PDF全文 |
