May 18 – 22, 2026
Virginia Tech
America/New_York timezone

Graph-based error correction code constructions made practical by modern decoder developments

May 18, 2026, 2:00 PM
25m
Goodwin Hall 125 (Virginia Tech)

Goodwin Hall 125

Virginia Tech

Minisymposium Talk Where Algebraic Coding Theory and Graph Theory Meet Where Algebraic Coding Theory and Graph Theory Meet

Speaker

Prof. Ken Duffy (Northeastern University)

Description

The study of error correcting codes has two important facets: code construction and decoder design. Many graph-based code constructions have been established to have desirable theoretical properties, but, heretofore, have not been practically decodable. In this talk, we explain recent developments in code-agnostic decoders, including soft-input soft-output variants, that offer a way forward in the provision of a practical decoder for such codes.

Author

Prof. Ken Duffy (Northeastern University)

Co-authors

Mr Lukas Rapp (MIT) Prof. Muriel Medard (MIT)

Presentation materials

There are no materials yet.