題目：Generalized quasi-cyclic codes over finite chain rings

主講人: 高健 副教授

時(shí)間：2025年1月3日（周五）10:00-11:00

地點(diǎn)：文理大樓723

摘要：

Linear codes over finite rings form an important research topic in coding theory, due to their applications in lattices, combinatorics and cryptography. Generalized quasi-cyclic (GQC) codes are important linear codes. They not only have good algebraic structures for coding and decoding, but also contain a lot of optimal linear codes. In this talk, we mainly focus on GQC codes over a class of finite chain rings, including their algebraic structures, weight distributions and their applications in some other fields.

個(gè)人簡(jiǎn)介：

高健，山東理工大學(xué)副教授，博士生導(dǎo)師，主要從事代數(shù)編碼理論及其應(yīng)用方面的研究，擔(dān)任期刊《電子與信息學(xué)報(bào)》第八屆、第九屆編委，美國(guó)數(shù)學(xué)會(huì)《Mathematical Reviews》評(píng)論員。目前，主持（或主持完成）山東省自然科學(xué)基金優(yōu)青、國(guó)家自然科學(xué)基金青年基金等項(xiàng)目4項(xiàng)，在IEEE Transactions on Information Theory、Finite Fields and Their Applications、Designs, Codes and Cryptography等國(guó)際知名期刊發(fā)表論文80余篇。入選愛(ài)思唯爾2024年度“全球前2%頂尖科學(xué)家”年度榜單。