THE CONSTRUCTION AND REALIZATION OF D=3 SM ARRAY CODES FOR HIGH-DIMENSION

Lin Bogang; Qiu Hongduan

Volume 22 Issue 2

Mar. 2000

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2000 > 22(2): 198-204

Lin Bogang, Qiu Hongduan. THE CONSTRUCTION AND REALIZATION OF D=3 SM ARRAY CODES FOR HIGH-DIMENSION[J]. Journal of Electronics & Information Technology, 2000, 22(2): 198-204.

Citation:

Lin Bogang, Qiu Hongduan. THE CONSTRUCTION AND REALIZATION OF D=3 SM ARRAY CODES FOR HIGH-DIMENSION[J]. Journal of Electronics & Information Technology, 2000, 22(2): 198-204.

Lin Bogang, Qiu Hongduan. THE CONSTRUCTION AND REALIZATION OF D=3 SM ARRAY CODES FOR HIGH-DIMENSION[J]. Journal of Electronics & Information Technology, 2000, 22(2): 198-204.

Citation:

Lin Bogang, Qiu Hongduan. THE CONSTRUCTION AND REALIZATION OF D=3 SM ARRAY CODES FOR HIGH-DIMENSION[J]. Journal of Electronics & Information Technology, 2000, 22(2): 198-204.

PDF( 1306 KB)

THE CONSTRUCTION AND REALIZATION OF D=3 SM ARRAY CODES FOR HIGH-DIMENSION

Lin Bogang^{①;邱宏端},
Qiu Hongduan

Received Date: 1998-04-14
Rev Recd Date: 1998-10-24
Publish Date: 2000-03-19

Abstract

Abstract

This paper is based on the concept system for D=2 SM array code proposed by the author in 1994. The coding rule and existence condition for D = 3 SM array code are given, and its structure property, construction step, design analysis and some use are also discussed.

FullText(HTML)

References(1)

References

林柏钢.基于D=2的SM阵列码构造.密码学进展--CHINA CRYPT94,第三届中国密码学术会议论文集,北京:科学出版社,1994,155-160.[2]林柏钢.Sbos相邻逻辑对称序列构造与实现方法.电子科学学刊,1991,13(5):502-508.[3]Games R A, Chan A H. A fast algorithm for determining the complexity of a binary sequence with period zn. IEEE Trans. on IT, 1983, IT-29(1): 144-146.[4]Mitchell C. Enumerating Boolean functions of cryptographic significance. J. Cryptology, 1990,2(3): 155-170.

Relative Articles

Supplements(0)

Cited By

Proportional views