1 citations · 1 across the 10 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2025
Higher-order Delsarte Dual LPs: Lifting, Constructions and Completeness
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones +2
A central and longstanding open problem in coding theory is the rate-versus-distance trade-off for binary error-correcting codes. In a seminal work, Delsarte introduced a family of…
cs.IT2022
Exact Completeness of LP Hierarchies for Linear Codes
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones
Determining the maximum size of a binary code of blocklength and distance remains an elusive open question even when restricted to the important class of linear…