| 最小距离固定且优于Gilbert—Varshamov界的码 |
| |
| 引用本文： | 吴新文. 最小距离固定且优于Gilbert—Varshamov界的码[J]. 数学进展, 2001, 30(6): 495-509 |
| |
| 作者姓名： | 吴新文 |
| |
| 作者单位： | 中国科学院数学研究所,数学与系统科学研究院, |
| |
| 基金项目： | This work was supportedin part by the National Natural Science Foundation of China(No. 19701033). |
| |
| 摘 要： | 本文构造了一类GF(q)上的码,其中GF(q)为q个元素的有限域.这些码的冗余取到渐进界r(q,n,7)4 m,此界优于Gilbert-Varshamov存在界r(q,n,7) 5m.
|
| 关 键 词： | 码 冗余 Hamming界 Gilbert－Varshamov界 渐近界 编码理论 |
| 修稿时间： | 1999-04-15 |
The Codes With FixedMinimum Distance and Better Than the Gilbert-Varshamov Bound |
| |
| Abstract. The Codes With FixedMinimum Distance and Better Than the Gilbert-Varshamov Bound[J]. Advances in Mathematics(China), 2001, 30(6): 495-509 |
| |
| Authors: | Abstract |
| |
| Abstract: | A class of codes over GF(q) is constructed, where q is a prime power. The codes achieve an asymptotic redundancy bound r(q, n, 7) m, which is better than the Gilbert-Varshamov existence bound r(q, n, 7) 5m. |
| |
| Keywords: | code redundancy Hamming bound Gilbert-Varshamov bound |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
