基于特殊陣列遞歸構(gòu)造Bent互補(bǔ)函數(shù)族
RECURSIVE CONSTRUCTIONS BASED ON SPECIAL ARRAYS FOR THE FAMILIES OF BENT COMPLEMENTARY FUNCTIONS
-
摘要: 本文進(jìn)一步研究Bent互補(bǔ)函數(shù)族的構(gòu)造。給出分別應(yīng)用列正交矩陣和列并元最佳陣列遞歸地構(gòu)造Bent互補(bǔ)函數(shù)族的方法。
-
關(guān)鍵詞:
- 信號設(shè)計; Bent函數(shù); Bent互補(bǔ)函數(shù)族
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]楊義先，林須端，著．編碼密碼學(xué)．北京：人民郵電出版社，1992，第一章，第三章．［6］許成謙，楊義先，胡正名．Bent互補(bǔ)函數(shù)族的性質(zhì)和構(gòu)造方法．電子學(xué)報,1997，25(10)：52-56．[6]Luke H,Bomer L,Antweiler M.Perfect binary array,Signal Processing,1989,17(1):69-80. -
計量
- 文章訪問數(shù): 1810
- HTML全文瀏覽量: 71
- PDF下載量: 394
- 被引次數(shù): 0
下載:
