Yang Guanzheng. SOME CONCLUSIONS ON BARKER CODES AND THE PROBLEM OF SEEKING BEST BINARY CODE[J]. Journal of Electronics & Information Technology, 1995, 17(1): 35-41.
Citation:
Yang Guanzheng. SOME CONCLUSIONS ON BARKER CODES AND THE PROBLEM OF SEEKING BEST BINARY CODE[J]. Journal of Electronics & Information Technology, 1995, 17(1): 35-41.
Yang Guanzheng. SOME CONCLUSIONS ON BARKER CODES AND THE PROBLEM OF SEEKING BEST BINARY CODE[J]. Journal of Electronics & Information Technology, 1995, 17(1): 35-41.
Citation:
Yang Guanzheng. SOME CONCLUSIONS ON BARKER CODES AND THE PROBLEM OF SEEKING BEST BINARY CODE[J]. Journal of Electronics & Information Technology, 1995, 17(1): 35-41.
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]李炳成,朱耀庭,朱光熹,等.基于分维的二相码选码方法.中国电子学会雷达专业学会,第五届学术年会论文集,武汉: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.