28 citations · 79 across the 28 of their papers we have counts for
9 papers · 1 filter
Explicit and Efficient Constructions of linear Codes Against Adversarial Insertions and Deletions
Roni Con, Amir Shpilka, Itzhak Tamo
In this work, we study linear error-correcting codes against adversarial insertion-deletion (insdel) errors, a topic that has recently gained a lot of attention. We construct linea…
Reed Solomon Codes Against Adversarial Insertions and Deletions
Roni Con, Amir Shpilka, Itzhak Tamo
In this work, we study the performance of Reed--Solomon codes against adversarial insertion-deletion (insdel) errors. We prove that over fields of size there are …
Reed-Muller Codes: Theory and Algorithms
Emmanuel Abbe, Amir Shpilka, Min Ye
Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. They are used in many areas of coding theory in both electrical engineering and c…
Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel
Roni Con, Amir Shpilka
This work gives an explicit construction of a family of error correcting codes for the binary deletion channel and for the Poisson repeat channel. In the binary deletion channel wi…
On the Performance of Reed-Muller Codes with respect to Random Errors and Erasures
Ori Sberlo, Amir Shpilka
This work proves new results on the ability of binary Reed-Muller codes to decode from random errors and erasures. We obtain these results by proving improved bounds on the weight…
Efficiently decoding Reed-Muller codes from random errors
Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Reed-Muller codes encode an -variate polynomial of degree by evaluating it on all points in . We denote this code by . The minimal distance of …
Reed-Muller codes for random erasures and errors
Emmanuel Abbe, Amir Shpilka, Avi Wigderson
This paper studies the parameters for which Reed-Muller (RM) codes over can correct random erasures and random errors with high probability, and in particular when can they…
Capacity achieving multiwrite WOM codes
Amir Shpilka
In this paper we give an explicit construction of a capacity achieving family of binary t-write WOM codes for any number of writes t, that have a polynomial time encoding and decod…
New constructions of WOM codes using the Wozencraft ensemble
Amir Shpilka
In this paper we give several new constructions of WOM codes. The novelty in our constructions is the use of the so called Wozencraft ensemble of linear codes. Specifically, we obt…