報(bào)告時(shí)間：3 December 2018，2:30-3:30pm (Monday)
報(bào)告地點(diǎn)：Room X7503#
主持人(Chair)： 周正春教授
報(bào)告題目: Two-level autocorrelation of sequences: An overview
Abstract:
Maximal length sequences (m-sequences) over an alphabet of size p, p a prime, are sequences having period p^n – 1 that are generated by a linear recursion of degree n. These sequences have many nice applications due to their celebrated two-valued autocorrelation property. There are several other sequences with similar two-level autocorrelation properties. In this talk we present a brief overview and history of the problem of finding binary and non-binary sequences with a two-valued autocorrelation.
Speaker’s Short Biography
Tor Helleseth教授是挪威科學(xué)院院士，Bergen大學(xué)終身教授，IEEE Fellow，中國(guó)外國(guó)專家局“高端外國(guó)專家項(xiàng)目”特聘專家，信息科學(xué)領(lǐng)域的國(guó)際著名學(xué)者，一直致力于基礎(chǔ)理論和應(yīng)用研究，在編碼理論、信息安全、組合數(shù)學(xué)等領(lǐng)域都做出了開創(chuàng)性和奠基性的工作，迄今已發(fā)表論文300余篇，其中包括國(guó)際信息論旗艦刊物《IEEE信息論會(huì)刊》100余篇。
