2 citations · 3 across the 3 of their papers we have counts for
4 papers · 1 filter
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…
An Elementary Proof of the First LP Bound on the Rate of Binary Codes
Nati Linial, Elyassaf Loyfer
The asymptotic rate vs. distance problem is a long-standing fundamental problem in coding theory. The best upper bound to date was given in 1977 and has received since then numerou…
Linear Programming Hierarchies in Coding Theory: Dual Solutions
Elyassaf Loyfer, Nati Linial
The rate vs. distance problem is a long-standing open problem in coding theory. Recent papers have suggested a new way to tackle this problem by appealing to a new hierarchy of lin…
New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes
Elyassaf Loyfer, Nati Linial
We develop a new family of linear programs, that yield upper bounds on the rate of binary linear codes of a given distance. Our bounds apply {\em only to linear codes.} Delsarte's…