5 citations · 9 across the 13 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019★ 1 cited
A Lower Bound for Relaxed Locally Decodable Codes
Tom Gur, Oded Lachish
A locally decodable code (LDC) C:{0,1}^k -> {0,1}^n is an error correcting code wherein individual bits of the message can be recovered by only querying a few bits of a noisy codew…
cs.DM2019
Longest paths in 2-edge-connected cubic graphs
Nikola K. Blanchard, Eldar Fischer, Oded Lachish +1
We prove almost tight bounds on the length of paths in -edge-connected cubic graphs. Concretely, we show that (i) every -edge-connected cubic graph of size has a path of…