等距碼的幾點注記
SOME NOTES FOR EOUIDISTAN T CODES
-
摘要: 設(shè)Q(n,d)為碼長為n,任意兩個不同碼字之間的Hamming距離為d的二元等距碼所能達(dá)到的最大碼字?jǐn)?shù),本文確定了Q(n,d)的一些精確值,并且給出了最優(yōu)等距碼的一些性質(zhì)。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]楊義先.電子學(xué)報,1993,21(7): 98-100.[5]魏萬迪.組合論(下冊).北京:科學(xué)出版社,1987,第13章第1節(jié).[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. -
計量
- 文章訪問數(shù): 1881
- HTML全文瀏覽量: 118
- PDF下載量: 377
- 被引次數(shù): 0
下載:
