57 citations · 161 across the 44 of their papers we have counts for
9 papers · 1 filter
Wedge-Lifted Codes
Jabari Hastings, Amy Kanne, Ray Li +1
We define wedge-lifted codes, a variant of lifted codes, and we study their locality properties. We show that (taking the trace of) wedge-lifted codes yields binary codes with the…
Improved List-Decodability of Reed--Solomon Codes via Tree Packings
Zeyu Guo, Ray Li, Chong Shangguan +2
This paper shows that there exist Reed--Solomon (RS) codes, over \black{exponentially} large finite fields \black{in the code length}, that are combinatorially list-decodable well…
Asynchronous Distributed Optimization with Stochastic Delays
Margalit Glasgow, Mary Wootters
We study asynchronous finite sum minimization in a distributed-data setting with a central parameter server. While asynchrony is well understood in parallel settings where the data…
Threshold rates for properties of random codes
Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch +2
Suppose that is a property that may be satisfied by a random code . For example, for some , might be the property that there exist three eleme…
Superbridge and Bridge Indices for Knots
Colin Adams, Nikhil Agarwal, Rachel Allen +4
We improve the upper bound on the superbridge index of a knot type in terms of the bridge index from to .
Hermitian-Lifted Codes
Hiram H. López, Beth Malmskog, Gretchen L Matthews +2
In this paper, we construct codes for local recovery of erasures with high availability and constant-bounded rate from the Hermitian curve. These new codes, called Hermitian-lifted…
Approximate Gradient Coding with Optimal Decoding
Margalit Glasgow, Mary Wootters
In distributed optimization problems, a technique called gradient coding, which involves replicating data points, has been used to mitigate the effect of straggling machines. Recen…
Bounds for list-decoding and list-recovery of random linear codes
Venkatesan Guruswami, Ray Li, Jonathan Mosheiff +3
A family of error-correcting codes is list-decodable from error fraction if, for every code in the family, the number of codewords in any Hamming ball of fractional radius …
Linear-time Erasure List-decoding of Expander Codes
Noga Ron-Zewi, Mary Wootters, Gilles Zémor
We give a linear-time erasure list-decoding algorithm for expander codes. More precisely, let be any integer. Given an inner code of length , and a -regular bip…