加入收藏  || English Version 
 
2019代数编码系列报告之二(邢朝平教授和金玲飞副教授)

  发布日期:2019-06-09  浏览量:312


  

报告题目:A survey on list decoding of classical block codes

人:邢朝平教授(新加坡南洋理工大学)

报告时间:2019611日(周二)下午1430

报告地点:澳门新莆京娱乐网站磬苑校区理工H306

报告摘要:In computer science, particularly in coding theory, list decoding is an alternative to unique decoding of error-correcting codes for large error rates. The notion was proposed by Elias in the 1950s. The main idea behind list decoding is that the decoding algorithm instead of outputting a single possible message outputs a list of possibilities one of which is correct. This allows for handling a greater number of errors than that allowed by unique decoding.

The unique decoding model in coding theory, which is constrained to output a single valid codeword from the received word could not tolerate greater fraction of errors. This resulted in a gap between the error-correction performance for stochastic noise models (proposed by Shannon) and the adversarial noise model (considered by Richard Hamming). Since the mid 90s, significant algorithmic progress by the coding theory community has bridged this gap. Much of this progress is based on a relaxed error-correction model called list decoding, wherein the decoder outputs a list of codewords for worst-case pathological error patterns where the actual transmitted codeword is included in the output list. In case of typical error patterns though, the decoder outputs a unique single codeword, given a received word, which is almost always the case (However, this is not known to be true for all codes). The improvement here is significant in that the error-correction performance doubles. This is because now the decoder is not confined by the half-the-minimum distance barrier. This model is very appealing because having a list of codewords is certainly better than just giving up. The notion of list-decoding has many interesting applications in complexity theory.

In this talk, we will survey some known results on list decoding of classical block codes under the adversarial noise model.

欢迎各位老师、同学届时前往!

澳门赌搏网站大全

2019年6月10日  

专家概况:邢朝平教授 1990 年在中国科学技术大学获得博士学位后,先后在中国、德国、奥地利和新加坡等国工作,目前任职于新加坡南洋理工大学,主要从事密码,编码,代数数论,计算机安全方面的研究。他曾获德国洪堡学者、新加坡国家科学奖、荷兰 Leiden 大学 Kloosterman 讲席教授等。他曾受邀在欧洲数学家大会和海外华人数学家大会上作特邀报告。出版专著五本,由剑桥出版社出版的 Coding Theory -- A First Course一书已在欧洲多所大学作为教材使用。先后在 Trans. Amer. Math. Soc.Advances in MathematicsJournal of Combinatorial Theory, Series AMathematics of ComputationIEEE Transactions on Information Theory 等国际权威期刊上发表 SCI 期刊论文 130 余篇,被 谷歌 Scholar 引用 4000 余次。承担过中国国家自然科学基金项目,新加坡国家科学技术基金,新加坡国防部基金,新加坡教育部基金等项目;特别是承担了新加坡国家研究基金局的重大项目,是新加坡第一个给基础理论研究的重大项目。目前任包括《IEEE Transactions on Information Theory》在内的多个SCI期刊编委。

 

金玲飞副教授学术报告

报告题目:Construction of MDS codes with complementary duals

人:金玲飞副教授(复旦大学)

报告时间:2019611日(周二)下午1530

报告地点:澳门新莆京娱乐网站磬苑校区理工H306

报告摘要:A Linear Complementary Dual (LCD for short) code is a linear code with complimentary dual. LCD codes have been extensively studied in literature. On the other hand, MDS codes are an important class of linear codes that have found wide applications in both theory and practice. This talk is going to show constructions of several classes of MDS codes with complimentary duals (i.e., LCD MDS codes) through generalized Reed-Solomon codes.

欢迎各位老师、同学届时前往!

澳门赌搏网站大全

2019年6月10日  

专家概况:金玲飞,复旦大学计算机科学技术学院副教授,硕导。2013年在新加坡南洋理工大学获得博士学位,分别在荷兰的信息科学研究中心和新加坡的南洋理工大学做过博士后。主要研究方向为编码密码,包括经典纠错码,量子纠错码,基于编码的密码等。目前已在IEEE Trans. On Information Theory 等杂志发表文章20余篇,主持了国家自然科学基金面上和青年项目各一项。

 

 

  

  

打印此页】【顶部】【关闭
   
版权所有 2019 澳门赌搏网站大全 All rights reserved 皖ICP备05018241号
地址:安徽省合肥市九龙路111号澳门新莆京娱乐网站磬苑校区理工楼H楼 邮编:230601 E-mail:math@ahu.edu.cn
访问统计:自2013年9月1日以来总访问:1000  后台管理


XML 地图 | Sitemap 地图