27 citations · 46 across the 9 of their papers we have counts for
3 papers · 2 filters
Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent
Matan Levi, Jonathan Mosheiff, Nikhil Shagrithaya
We establish an equivalence between two important random ensembles of linear codes: random linear codes (RLCs) and random Reed-Solomon (RS) codes. Specifically, we show that these…
When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
Dean Doron, Jonathan Mosheiff, Mary Wootters
The Gilbert--Varshamov (GV) bound is a classical existential result in coding theory. It implies that a random linear binary code of rate has relative distance at least $\fra…
Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes
Jonathan Mosheiff, Nicolas Resch, Kuo Shang +1
We wish to generate list-decodable codes over small alphabets using as little randomness as possible. Specifically, we hope to generate codes achieving what we term the Elias bound…