高维D=3 SM阵列编码构造和实现
THE CONSTRUCTION AND REALIZATION OF D=3 SM ARRAY CODES FOR HIGH-DIMENSION
-
摘要: 本文基于第一作者1994年提出的D=2 SM阵列码的概念体系,进一步给出D=3 SM阵列码的编码规则和存在条件,并讨论其结构特点、构造步骤和设计分析。最后指出其编码性能和用途。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.
-
林柏钢.基于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. -
计量
- 文章访问数: 1776
- HTML全文浏览量: 72
- PDF下载量: 442
- 被引次数: 0
下载:
