2 citations · 3 across the 3 of their papers we have counts for
Showing 2022 · cs.ITShow all
2 papers · 2 filters
cs.IT2022★ 1 cited
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…
cs.IT2022★ 2 cited
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…