SOME NOTES FOR EOUIDISTAN T CODES

Fu Fangwei; Shen Shiyi

Volume 17 Issue 5

Sep. 1995

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1995 > 17(5): 535-538

Fu Fangwei, Shen Shiyi. SOME NOTES FOR EOUIDISTAN T CODES[J]. Journal of Electronics & Information Technology, 1995, 17(5): 535-538.

Citation:

Fu Fangwei, Shen Shiyi. SOME NOTES FOR EOUIDISTAN T CODES[J]. Journal of Electronics & Information Technology, 1995, 17(5): 535-538.

Fu Fangwei, Shen Shiyi. SOME NOTES FOR EOUIDISTAN T CODES[J]. Journal of Electronics & Information Technology, 1995, 17(5): 535-538.

Citation:

Fu Fangwei, Shen Shiyi. SOME NOTES FOR EOUIDISTAN T CODES[J]. Journal of Electronics & Information Technology, 1995, 17(5): 535-538.

PDF( 620 KB)

SOME NOTES FOR EOUIDISTAN T CODES

Received Date: 1994-05-03
Rev Recd Date: 1994-10-24
Publish Date: 1995-09-19

Abstract

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.

FullText(HTML)

References(1)

References

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.

Relative Articles

Supplements(0)

Cited By

Proportional views