摘要
本文构造了一类GF(q)上的码,其中GF(q)为q个元素的有限域,这些码的冗余取到渐进界r(q,n,7) m,此界优于 Gilbert-Varshamov存在界,r(q,n,7) 5m.
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.
出处
《数学进展》
CSCD
北大核心
2001年第6期495-509,共15页
Advances in Mathematics(China)
基金
in part by the National Natural Science Foundation of China(No. 19701033).