3 citations · 5 across the 21 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
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…
cs.DS2022
Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
Fernando Granha Jeronimo, Tushant Mittal, Sourya Roy +1
We give an efficient algorithm that transforms any bounded degree expander graph into another that achieves almost optimal (namely, near-quadratic, ) trade-off…