4 papers
One Code Fits All: Strong stuck-at codes for versatile memory encoding
Roni Con, Ryan Gabrys, Eitan Yaakobi
In this work we consider a generalization of the well-studied problem of coding for ``stuck-at'' errors, which we refer to as ``strong stuck-at'' codes. In the traditional framewor…
An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes
Shubhransh Singhvi, Roni Con, Han Mao Kiah +1
The sequence reconstruction problem, introduced by Levenshtein in 2001, considers a scenario where the sender transmits a codeword from some codebook, and the receiver obtains …
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
Roni Con, Noah Shutty, Itzhak Tamo +1
This paper presents two repair schemes for low-rate Reed-Solomon (RS) codes over prime fields that can repair any node by downloading a constant number of bits from each surviving…
Improved Upper and Lower Bounds on the Capacity of the Binary Deletion Channel
Ittai Rubinstein, Roni Con
The {\em binary deletion channel} with deletion probability () is a random channel that deletes each bit of the input message i.i.d with probability . It has b…