38 citations · 173 across the 31 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
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…
math.CO2022
An approach to the girth problem in cubic graphs
Aya Bernstine, Nati Linial
We offer a new, gradual approach to the largest girth problem for cubic graphs. It is easily observed that the largest possible girth of all -vertex cubic graphs is attained by…
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…