3 citations · 5 across the 21 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…
cs.DS2021
Explicit Abelian Lifts and Quantum LDPC Codes
Fernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell +2
For an abelian group acting on the set , an -lift of a graph is a graph obtained by replacing each vertex by copies, and each edge by a matching…