基本信息
浏览量:461
职业迁徙
个人简介
Among other honors, he is a Fellow of the IEEE and a past Editor-in-Chief of the IEEE Transactions on Information Theory.
Vardy is a recipient of a David and Lucile Packard Fellowship and an NSF CAREER award.
Professor Vardy is a leading expert in coding theory. With coding and decoding of error-correcting codes taking place in a plethora of devices, from satellites to cell phones and from computer drives to CDs, his work has widespread implications. His research is leading to a better understanding of the uses and limitations of error-correcting codes in encoding data for transmission and storage. Soft-decision decoders capture more information from an encoded signal than conventional hard-decision decoders, and thereby enable reliable communication at lower signal power. Vardy has co-developed an efficient algebraic soft-decision decoder for Reed-Solomon codes, which are the most popular class of error-correcting codes in use today. It has long been known that random codes achieve channel capacity. However, Vardy proved that computing the distance of a random code, which is necessary for its evaluation, is an intractable problem. He has also helped explain mathematically why iterative codes (such as turbo codes and LDPC codes) come close to achieving capacity.
Vardy is a recipient of a David and Lucile Packard Fellowship and an NSF CAREER award.
Professor Vardy is a leading expert in coding theory. With coding and decoding of error-correcting codes taking place in a plethora of devices, from satellites to cell phones and from computer drives to CDs, his work has widespread implications. His research is leading to a better understanding of the uses and limitations of error-correcting codes in encoding data for transmission and storage. Soft-decision decoders capture more information from an encoded signal than conventional hard-decision decoders, and thereby enable reliable communication at lower signal power. Vardy has co-developed an efficient algebraic soft-decision decoder for Reed-Solomon codes, which are the most popular class of error-correcting codes in use today. It has long been known that random codes achieve channel capacity. However, Vardy proved that computing the distance of a random code, which is necessary for its evaluation, is an intractable problem. He has also helped explain mathematically why iterative codes (such as turbo codes and LDPC codes) come close to achieving capacity.
研究兴趣
论文共 250 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
Adv. Math. Commun.no. 4 (2023): 960-978
引用0浏览0EI引用
0
0
IEEE Journal on Selected Areas in Information Theory (2023): 784-793
arxiv(2022)
引用5浏览0EIWOS引用
5
0
arxiv(2022)
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn