等距码的几点注记
SOME NOTES FOR EOUIDISTAN T CODES
-
摘要: 设Q(n,d)为码长为n,任意两个不同码字之间的Hamming距离为d的二元等距码所能达到的最大码字数,本文确定了Q(n,d)的一些精确值,并且给出了最优等距码的一些性质。Abstract: Let Q(n,d) denote the largest number of cod-words in any binary equidistant code of length n and Hamming distance d between code words, this paper determines some exact values of Q(n,d), and presents several properties of optimal equidistant codes.
-
Van Lint J H. Discrete Math, 1973, 6(3): 353-358.[2]Hall J I. Discrete Math, 1977, 17(1): 85-94.[3]Hall J I, et al. Discrete Math, 1977, 17(1): 71-83.[4]杨义先.电子学报,1993,21(7): 98-100.[5]魏万迪.组合论(下册).北京:科学出版社,1987,第13章第1节.[6]MacWilliama F d, Sloane N J A. The Theory of Error-Correcting Codes, Third printing, North-Holland, Amsterdam: Elsevier Science Publishing Company, 1981, Chapter 17. -
计量
- 文章访问数: 1858
- HTML全文浏览量: 112
- PDF下载量: 377
- 被引次数: 0
下载:
