47 citations · 47 across the 4 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2023
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…
cs.IT2022
Average-Case to (shifted) Worst-Case Reduction for the Trace Reconstruction Problem
Ittai Rubinstein
The {\em insertion-deletion channel} takes as input a binary string , and outputs a string where some of the bits have been deleted and others inse…
cs.IT2021
Explicit and Efficient Construction of (nearly) Optimal Rate Codes for Binary Deletion Channel and the Poisson Repeat Channel
Ittai Rubinstein
Two of the most common models for channels with synchronisation errors are the Binary Deletion Channel with parameter () -- a channel where every bit of the codew…