4 citations · 6 across the 2 of their papers we have counts for
4 papers
Trace Reconstruction with Bounded Edit Distance
Jin Sima, Jehoshua Bruck
The trace reconstruction problem studies the number of noisy samples needed to recover an unknown string with high probability, where the samples are i…
Optimal -Deletion Correcting Codes
Jin Sima, Jehoshua Bruck
Levenshtein introduced the problem of constructing -deletion correcting codes in 1966, proved that the optimal redundancy of those codes is , and proposed an optimal…
On Coding over Sliced Information
Jin Sima, Netanel Raviv, Jehoshua Bruck
The interest in channel models in which the data is sent as an unordered set of binary strings has increased lately, due to emerging applications in DNA storage, among others. In t…
Two Deletion Correcting Codes from Indicator Vectors
Jin Sima, Netanel Raviv, Jehoshua Bruck
Construction of capacity achieving deletion correcting codes has been a baffling challenge for decades. A recent breakthrough by Brakensiek ., alongside novel applications i…