基于特殊阵列递归构造Bent互补函数族
RECURSIVE CONSTRUCTIONS BASED ON SPECIAL ARRAYS FOR THE FAMILIES OF BENT COMPLEMENTARY FUNCTIONS
-
摘要: 本文进一步研究Bent互补函数族的构造。给出分别应用列正交矩阵和列并元最佳阵列递归地构造Bent互补函数族的方法。Abstract: In this paper, the constructions for the families of Bent complementary functions (BCF) are further studied. Recursive construction methods of BCFs are given by using matrices with orthogonal columns and perfect arrays.
-
Rothaus O S.On Bent functions,J[J].of Combin.Theory.1976,20(A):300-305[2]MacWilliams F J,Sloane N J A.The theory of error-corrorecting codes,Amsterdam,North-Holland:North-Holland Publishing Company,1977,Chapter 14.[3]Olsen J,Scholtz R,Welch L.Bent function sequences,IEEE Trans.on Inform.Theory,1982,IT-28(6):858-864.[4]Kumar P V.Frequency-hopping code sequences designs having large linear span,IEEE Trans.on Inform.Theory,1988,IT-34(1):146-151.[5]杨义先，林须端，著．编码密码学．北京：人民邮电出版社，1992，第一章，第三章．［6］许成谦，杨义先，胡正名．Bent互补函数族的性质和构造方法．电子学报,1997，25(10)：52-56．[6]Luke H,Bomer L,Antweiler M.Perfect binary array,Signal Processing,1989,17(1):69-80. -
计量
- 文章访问数: 1792
- HTML全文浏览量: 65
- PDF下载量: 391
- 被引次数: 0
下载:
