1 citations · 2 across the 14 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.IT2021
A Complete Linear Programming Hierarchy for Linear Codes
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones
A longstanding open problem in coding theory is to determine the best (asymptotic) rate of binary codes with minimum constant (relative) distance . An existential lower…
math.CO2021★ 1 cited
Biregularity in Sidorenko's Conjecture
Leonardo N. Coregliano, Alexander A. Razborov
Sidorenko's Conjecture says that the minimum density of a bigraph in a bigraphon of a given edge density is attained when is a constant function. A consequence of a res…