<cite id="xvznh"><span id="xvznh"><var id="xvznh"></var></span></cite>
<span id="xvznh"><video id="xvznh"></video></span><strike id="xvznh"><dl id="xvznh"></dl></strike>
<th id="xvznh"><noframes id="xvznh"><span id="xvznh"></span>
<strike id="xvznh"></strike><span id="xvznh"></span>
<ruby id="xvznh"></ruby>
<strike id="xvznh"></strike>
<strike id="xvznh"><dl id="xvznh"></dl></strike><strike id="xvznh"><i id="xvznh"></i></strike>
<span id="xvznh"></span>
11月26日:Tor Helleseth,Patrick Solé & 施敏加
發布時間:2019-11-25  閱讀次數:8941

報告一:Tor Helleseth

 

報告題目:50 years history of the cross correlation between m-sequences

報告人Professor Tor Helleseth University of Bergen

主持人李成舉  

報告時間:2019年11月26日 14:30-15:30

報告地點:理科大樓B1102

 

報告摘要:

Maximum-length sequences (or m-sequences) of period 2^m-1 are generated by a linear feedback shift register of degree m. These sequences have many important applications in modern communication systems. The most well known property of m-sequences is their well-known two-level ideal autocorrelation. The first major result on the cross correlation is the determination of the cross correlation between the m-sequences used in constructing the famous Gold sequences that was published 50 years ago in January 1968. During the last 50 years the cross correlation between m-sequences of the same period has been intensively studied by many research groups. Many important results have been obtained but still many open problems remain in this area. This talk will give an updated survey of the status of the cross correlation of m-sequences as well as some consequences of these results.

周期為2^m-1的最大長度序列(或m序列)是由m次線性反饋移位寄存器產生的。這些序列在現代通信系統中有許多重要的應用。m序列最著名的性質是眾所周知的兩值理想自相關。第一個主要結果是確定了50年前1968年1月發表的構造著名Gold序列所用的m序列之間的互相關值。近50年來,m序列間的相互關系已被許多研究小組深入研究。雖然取得了許多重要的研究成果,但仍存在許多有待解決的問題。本次報告介紹m序列的互相關值的現狀與相關結果。

報告人簡介:

Tor Helleseth (IEEE Fellow) received his Dr. Philos. degree in mathematics from the University of Bergen, Norway, in 1979. During the academic years 1977-1978 and 1992-1993 he was on sabbatical leave at the University of Southern California, USA, and during 1979-1980 he was a Postdoctoral fellow at the Eindhoven University of Technology, The Netherlands. From 1981 to 1984 he was a researcher at the Chief Headquarters of Defense in Norway. Since 1984 has he has been Professor at the Department of Informatics, University of Bergen. He served as an Associate Editor for IEEE Transactions on Information Theory, 1991-1993 for Coding Theory and 2012-2014 for Sequences. He is on the editorial board for Designs, Codes and Cryptography (DCC), and Cryptography and Communications: Discrete Structures, Boolean Functions and Sequences (CCDS). He has published more than 350 papers in international refereed journals and conferences in coding theory, cryptography and sequence designs, including more than 100 co-authors from more than 25 countries. He was the program co-chair for Eurocrypt’93, IEEE Information Theory Workshop, ITW1997, ITW2007, Arctic Crypt 2016 and for Sequences and Their Applications, SETA’98, SETA’04, SETA’06, SETA’12 and SETA’18. Professor Helleseth was a coordinator of NISNet, a national network in information security, in Norway 2007-2011. In 1997 he was elected IEEE Fellow for his "Contributions to Coding Theory and Cryptography" and in 2004 elected member of the Norwegian Academy of Science (Det Norske Videnskaps-Akademi). He served on the Board of Governors for the IEEE IT-Society during 2007-2009. His interests include coding theory, cryptography, sequence designs, finite fields and discrete mathematics.

 

Tor Helleseth (IEEE Fellow)在1979年獲挪威卑爾根大學數學博士學位。1979-1980年期間,他是荷蘭Eindhoven理工大學的博士后研究員。1981-1984年期間,他是挪威國防總部的研究員。自1984年以來,他一直是卑爾根大學信息學系的教授。擔任《IEEE Transactions on Information Theory》副編輯,1991-1993年負責編碼理論,2012-2014年,負責序列。他是《Designs, Codes and Cryptography》(DCC)和《Cryptography and Communications: Discrete Structures, Boolean Functions and Sequences》(CCDS)的編輯委員會成員。他在編碼理論、密碼學和序列設計方面的國際期刊和會議上發表了350多篇論文,包括來自25個國家的100多名合作者。他曾擔任Eurocrypt ' 93、 ITW1997、ITW2007、Arctic Crypt 2016以及SETA ' 98、SETA ' 04、SETA ' 06、SETA ' 12和SETA ' 18 的聯合主席。Helleseth教授是2007-2011年挪威國家信息安全網絡NISNet的協調員。1997年,他因為對編碼和密碼的貢獻被選為IEEE會士,2004年,他被選為挪威科學院院士。2007-2009年期間,他擔任IEEE IT協會的理事會成員。他的研究興趣包括編碼理論、密碼學、序列設計、有限域和離散數學。

 

報告二:Patrick Solé

 

報告題目:Two recent results on additive quaternary codes

報告人Professor  Patrick Solé    University of Paris 8

主持人李成舉  

報告時間:2019年11月26日 15:30-16:30

報告地點:理科大樓B1102

 

報告摘要:

Additive codes are codes over GF(4) that are closed under addition but not under scalar multiplication. We show that the punctured dodecacode  is  uniformly packed solving an open problem from 1974 (joint work with Shi and Krotov). We prove that additive cyclic codes are asymptotically good (joint work with Shi and Wu).

加性碼是在GF(4)上的碼,它在加法下是封閉的,而在標量乘法下是不封閉的。我們證明了穿孔十二進制碼是均勻壓縮碼,解決了1974年的一個開放問題(與Shi和Krotov的聯合工作)。我們證明了加性循環碼是漸近好的(與Shi和Wu的聯合工作)。

報告人簡介:

巴黎第八大學教授,國際著名的代數編碼與密碼學專家。研究領域包括代數組合、代數圖論、代數編碼、離散數學、格的構造、模形式等。目前已在國際著名期刊《IEEE Transaction on Information Theory》, 《Finite Fields and Their Applications》, 《Journal of Algebra》, 《Journal of Combinatorial Theory Series B》, 《Bulletin of the American Mathematical Society》 等發表170余篇專業學術論文,在國際學術會議上發表論文70余篇,出版英文專著3本。1995年,與其合作者撰寫的論文“The linearity of Kerdock, Preparata, Goethals, and related codes”獲信息論方面的最佳論文獎, 已經被他引1300余次。曾擔任《IEEE Transactions on Information Theory》副編輯,目前擔任多個SCI期刊編委。

 

報告三:施敏加

 

報告題目:On one symbol-pair cyclic codes

報告人施敏加教授  安徽大學

主持人李成舉  

報告時間:2019年11月26日 16:30-17:30

報告地點:理科大樓B1102

 

報告摘要:

The symbol-pair metric was introduced by Cassuto and Blaum in 2010 in connection with symbol-pair channels. In this note, we present a new combinatorial characterization for the symbol-pair weight by run of $0$'s of length $i$, and study three classes of one symbol-pair weight cyclic codes. The arguments are based on properties of two different notions of runs. The symbol run for the first two classes, and a burst error type of run in the case of two-dimensional cyclic codes. An extension of the first two constructions to codes for $b$-symbol read channels introduced by Yaakobi et al. in 2016 is sketched out.

在這次討論中,本文提出了一種新的符號對權重的組合特征,并研究了三類單符號對權重循環碼。這些論點基于兩種不同的運行,即:前兩類的符號運行,以及在二維循環碼的情況下的突發錯誤類型的運行。

報告人簡介:

施敏加,教授,博士研究生導師,基礎數學系主任,安徽省學術與技術帶頭人,曾獲安徽省自然科學一等獎與第二屆“安徽省青年數學獎”。主持國家自然科學基金3項,安徽省自然科學基金杰出青年基金等省部級重點項目5項。出版英文專著2本,在《IEEE Transaction on Information Theory》、《Designs, Codes and Cryptography》、《Finite Fields and Their Applications》等國內外重要學術期刊上發表學術論文80余篇,其中 SCI檢索60余篇。曾應邀訪問法國,新加坡等國家。

華東師范大學軟件工程學院
www.pusatkosmetika.com Copyright Software Engineering Institute
院長信箱:yuanzhang@sei.ecnu.edu.cn | 院辦電話:021-62232550 | 學院地址:上海中山北路3663號理科大樓
999彩票app下载软件