等距码的几点注记

Download: PDF (620 KB)
Export: BibTeX | EndNote (RIS)

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.

Key words： Equidistant code Hadamard matrix Block design Plotkin bound Grey-Rankin bound

Received: 03 May 1994

PACS:

TN911.21

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors


	Fu Fangwei
	Shen Shiyi

Cite this article:

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

URL:

http://jeit.ie.ac.cn/EN/ OR http://jeit.ie.ac.cn/EN/Y1995/V17/I5/535

[1]	Zhao Sheng-Mei, Zhu Xiu-Li, Xiao Yu. A Novel Construction of Quantum LDPC Codes Based on Balanced Incomplete Block Designs[J]. , 2011, 33(1): 218-222.