高维大码距Hamilton阵列编码理论与综合算法

Abstract
Figure/Table
References
Related Citation (9)

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

Abstract In this paper, the theory of Hamilton array codes for high dimension and big Hamming distance is proposed. The model of logical topology structure for d- 2k-l,d=2k(k >3) types and the existence topology condition for general high order SM array codes are analyzed. The construction principle and the synthesis algorithm of SM array codes for d=2k- 1 and d=2k(k >3) high dimension and high order are discussed. Finally, the distinction between the two models and the example design are given. The result provides a new direction for a class of new type array ciphers research.

Key words： SM array codes for high dimension and big Hamming distance Hamilton logical path Topology structure model Existence restraint condition Synthesis algorithm

Received: 17 December 2001

PACS:

TN911.31

	Service

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

	Lin Bogang

Cite this article:

Lin Bogang. The theory of hamilton array codes for high dimension and big hamming distance and the synthesis algorithm[J]. , 2003, 25(7): 907-917 .

URL:

http://jeit.ie.ac.cn/EN/ OR http://jeit.ie.ac.cn/EN/Y2003/V25/I7/907