報告題目：A subfield-based construction of optimal linear codes over finite fields
報告摘要：Linear codes have a wide range of applications in the data storage systems, communication systems and consumer electronics products. In this talk, we present four families of linear codes over finite fields from the complements of either the union of subfields or the union of cosets of a subfield, which can produce infinite families of optimal linear codes, including infinite families of (near) Griesmer codes. We characterize the optimality of these four families of linear codes with an explicit computable criterion using the Griesmer bound and obtain many distance optimal linear codes. In addition, by a more in-depth discussion on some special cases of these four families of linear codes, we obtain several classes of (distance) optimal linear codes with few weights and completely determine their weight distributions. We also show that most of our linear codes are self-orthogonal or minimal which are useful in applications.
報告時間：2022年11月15日14:30
報告地點：騰訊會議号196 722 571
邀 請 人：杜小妮 教授
屆時歡迎廣大師生參與交流！
報告人簡介
李念，湖北大學教授，博士生導師。2013年于西南交通大學獲博士學位，導師唐小虎教授；博士期間在挪威卑爾根大學聯合培養兩年，導師Tor Helleseth院士；随後三年先後于香港科技大學和挪威卑爾根大學繼續從事關于代數編碼與密碼方面的博士後和研究員工作，合作導師為熊茂勝和Lilya Budaghyan教授。主要研究密碼、編碼及其相關的數學理論。近年來在密碼函數、線性碼、序列設計等領域做出了⼀系列成果，主持國家自然科學基金2項、湖北省傑青等省部級基金3項，代表性成果發表在國内外重要學術期刊《IEEE Transactions on Information Theory》、《Designs, Codes and Cryptography》和《Finite Fields and Their Applications》等上。2017年和2019年分别入選湖北省楚天學者計劃和湖北省百人計劃。
