Barker碼的一些結(jié)論和二元碼的優(yōu)選問題
SOME CONCLUSIONS ON BARKER CODES AND THE PROBLEM OF SEEKING BEST BINARY CODE
-
摘要: 本文最終證明了不存在n13位的Barker碼,并探索了二相碼的解析優(yōu)選法。文中定義了一個Yn矩陣,并由Yn導(dǎo)出了二相碼的重量w,Hamming距離d,游程數(shù)和碼長n之間的關(guān)系式,所得關(guān)系不僅揭示出二相碼各參數(shù)之間的內(nèi)在聯(lián)系,而且可用它來解決Barker碼的存在性問題,從而將二相碼的優(yōu)選問題建立在解析的基礎(chǔ)上。文中還舉出了應(yīng)用實(shí)例。
-
關(guān)鍵詞:
- Barker碼; 二元碼; 選碼方法
Abstract: A new method that seek out best binary code by means of analytics is proposed in this paper, and it was proved that there is no n 13 Barker code as well. -
Lindner J. Electron. Lett., 1975, 11(2):507-508.[2]Cohn M N, Fox M, Baden J M. Minimum Peak Sidelobe Pulse Compression Codes. The Record of the IEEE, 1990 International Radar Conference. New York: 1990. 633-638.[3]李炳成,朱耀庭,朱光熹,等.基于分維的二相碼選碼方法.中國電子學(xué)會雷達(dá)專業(yè)學(xué)會,第五屆學(xué)術(shù)年會論文集,武漢:1989,669-674.[4]Barker R H. Group Synchonizing of Binary Digital Systems. in Communication Theory, Jackson W, ed. New York: Academic Press, Inc., 1953. 273-287.[5]Turyn R, Storer J E. Proc[J].Am. Math. Soc.1961, 12(1):394-399[6]Luenburger D G. Proc. IEEE, 1963, 51(1): 230-231.[7]Turyn R. Proc. IEEE (Correspondence), 1963, 51(9): 1256.[8]胡正名,陳啟浩.矩陣方法.北京:人民郵電出版社,1984,134-137. -
計(jì)量
- 文章訪問數(shù): 2258
- HTML全文瀏覽量: 117
- PDF下載量: 500
- 被引次數(shù): 0
下載:
