{"id":2541,"date":"2025-02-28T20:40:51","date_gmt":"2025-02-28T20:40:51","guid":{"rendered":"https:\/\/meyn.ece.ufl.edu\/?page_id=2541"},"modified":"2026-03-21T12:07:58","modified_gmt":"2026-03-21T17:07:58","slug":"multi-agent-reinforcement-learning-for-wind-farm-control","status":"publish","type":"page","link":"https:\/\/faculty.eng.ufl.edu\/meyn\/c3\/c3-9\/multi-agent-reinforcement-learning-for-wind-farm-control\/","title":{"rendered":"The linear reliability channel: a discrete framework for soft decision error correction decoding"},"content":{"rendered":"

Ken Duffy<\/a> (Northeastern)<\/h3>\n

In a hard detection setting, the minimum Hamming distance and, more generally, the Hamming weight spectrum of a binary linear error correction code form key indicators of its quality. In the presence of soft information, where each received bit has an associated likelihood of being correct, Hamming statistics are usually regarded as being appropriate proxies for code quality as it is not evident how to incorporate the impact of the continuous side information into considerations.<\/span><\/p>\n

Inspired by the operation of Ordered Reliability Bits Guessing Random Additive Noise, which has recently been proven to be almost capacity achieving and has been taped out in chips, we introduce a simple new model of the soft detection setting called the Linear Reliability Channel. Despite capturing all core facets of soft information decoding, it is a discrete model where soft detection channel reliabilities are described by the declaration of a random permutation of received bits. This channel model provides a discrete framework for assessing soft detection performance through combinatoric considerations, including the determination of appropriate statistical correlates to high quality soft detection codes.<\/span><\/p>\n

This talk is based on work with Alexander Mariona (MIT) and Muriel Medard (MIT).<\/span><\/p>\n

\"\"Bio: <\/strong>Ken R. Duffy is a professor at Northeastern University with a joint appointment in the Department of Electrical & Computer Engineering, where he served as interim chair, and the Department of Mathematics. He received a B.A (mod) in Mathematics and a PhD in Applied Probability, both awarded by Trinity College Dublin. He was previously a professor at National University of Ireland, Maynooth, where he was the Director of the Hamilton Institute, an interdisciplinary research centre, from 2016 to 2022. He was one of three co-Directors of the Science Foundation Ireland Centre for Research Training in Foundations of Data Science, which funded more than 120 PhD students. He is a co-founder of the Royal Statistical Society\u2019s Applied Probability Section (2011), co-authored a cover article of Trends in Cell Biology (2012), is a winner of a best paper award at the IEEE International Conference on Communications (2015), the best paper award from IEEE Transactions on Network Science and Engineering (2019), the best research demo award from COMSNETS (2022), the best demo award from COMSNETS (2023), and the IEEE Milcom Fred W. Ellersick award for best unclassified paper (2024). He is an associate editor of IEEE Transactions on Information Theory and of IEEE Transactions on Molecular, Biological, and Multi-scale Communications.<\/p>\n","protected":false},"excerpt":{"rendered":"

Ken Duffy (Northeastern) In a hard detection setting, the minimum Hamming distance and, more generally, the Hamming weight spectrum of a binary linear error correction code form key indicators of its quality. In the presence of soft information, where each received bit has an associated likelihood of being correct, Hamming statistics are usually regarded as […]<\/p>\n","protected":false},"author":1347,"featured_media":0,"parent":2631,"menu_order":2,"comment_status":"closed","ping_status":"closed","template":"page-templates\/page-section-nav.php","meta":{"_acf_changed":false,"inline_featured_image":false,"featured_post":"","footnotes":"","_links_to":"","_links_to_target":""},"class_list":["post-2541","page","type-page","status-publish","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/faculty.eng.ufl.edu\/meyn\/wp-json\/wp\/v2\/pages\/2541","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/faculty.eng.ufl.edu\/meyn\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/faculty.eng.ufl.edu\/meyn\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/faculty.eng.ufl.edu\/meyn\/wp-json\/wp\/v2\/users\/1347"}],"replies":[{"embeddable":true,"href":"https:\/\/faculty.eng.ufl.edu\/meyn\/wp-json\/wp\/v2\/comments?post=2541"}],"version-history":[{"count":1,"href":"https:\/\/faculty.eng.ufl.edu\/meyn\/wp-json\/wp\/v2\/pages\/2541\/revisions"}],"predecessor-version":[{"id":2731,"href":"https:\/\/faculty.eng.ufl.edu\/meyn\/wp-json\/wp\/v2\/pages\/2541\/revisions\/2731"}],"up":[{"embeddable":true,"href":"https:\/\/faculty.eng.ufl.edu\/meyn\/wp-json\/wp\/v2\/pages\/2631"}],"wp:attachment":[{"href":"https:\/\/faculty.eng.ufl.edu\/meyn\/wp-json\/wp\/v2\/media?parent=2541"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}