activity
20112025
most citedSnake-in-the-Box Codes for Rank Modulation

52 citations · 183 across the 15 of their papers we have counts for

collaborators

15 papers

cs.IT2025

Correcting Multiple Substitutions in Nanopore-Sequencing Reads

Anisha Banerjee, Yonatan Yehezkeally, Antonia Wachter-Zeh +1

Despite their significant advantages over competing technologies, nanopore sequencers are plagued by high error rates, due to physical characteristics of the nanopore and inherent…

cs.IT2025★ 4 cited

Coding for Strand Breaks in Composite DNA

Frederik Walter, Yonatan Yehezkeally

Due to their sequential nature, traditional DNA synthesis methods are expensive in terms of time and resources. They also fabricate multiple copies of the same strand, introducing…

cs.IT2024

Correcting a Single Deletion in Reads from a Nanopore Sequencer

Anisha Banerjee, Yonatan Yehezkeally, Antonia Wachter-Zeh +1

Owing to its several merits over other DNA sequencing technologies, nanopore sequencers hold an immense potential to revolutionize the efficiency of DNA storage systems. However, t…

cs.IT2023★ 15 cited

Error-Correcting Codes for Nanopore Sequencing

Anisha Banerjee, Yonatan Yehezkeally, Antonia Wachter-Zeh +1

Nanopore sequencing, superior to other sequencing technologies for DNA storage in multiple aspects, has recently attracted considerable attention. Its high error rates, however, de…

cs.IT2022★ 1 cited

Bounds on Mixed Codes with Finite Alphabets

Yonatan Yehezkeally, Haider Al Kim, Sven Puchinger +1

Mixed codes, which are error-correcting codes in the Cartesian product of different-sized spaces, model degrading storage systems well. While such codes have previously been studie…

cs.IT2022★ 12 cited

Generalized Unique Reconstruction from Substrings

Yonatan Yehezkeally, Daniella Bar-Lev, Sagi Marcovich +1

This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by…

cs.IT2022

Reconstruction from Substrings with Partial Overlap

Yonatan Yehezkeally, Daniella Bar-Lev, Sagi Marcovich +1

This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by…

cs.IT2022★ 19 cited

Adversarial Torn-paper Codes

Daniella Bar-Lev, Sagi Marcovich, Eitan Yaakobi +1

We study the adversarial torn-paper channel. This problem is motivated by applications in DNA data storage where the DNA strands that carry information may break into smaller piece…

cs.IT2021★ 6 cited

Multi-strand Reconstruction from Substrings

Yonatan Yehezkeally, Sagi Marcovich, Eitan Yaakobi

The problem of string reconstruction based on its substrings spectrum has received significant attention recently due to its applicability to DNA data storage and sequencing. In co…

cs.IT2021★ 3 cited

On Codes for the Noisy Substring Channel

Yonatan Yehezkeally, Nikita Polyanskii

We consider the problem of coding for the substring channel, in which information strings are observed only through their (multisets of) substrings. Due to existing DNA sequencing…

cs.IT2020★ 5 cited

Uncertainty of Reconstruction with List-Decoding from Uniform-Tandem-Duplication Noise

Yonatan Yehezkeally, Moshe Schwartz

We propose a list-decoding scheme for reconstruction codes in the context of uniform-tandem-duplication noise, which can be viewed as an application of the associative memory model…

cs.IT2019★ 22 cited

Single-Error Detection and Correction for Duplication and Substitution Channels

Yuanyuan Tang, Yonatan Yehezkeally, Moshe Schwartz +1

Motivated by mutation processes occurring in in-vivo DNA-storage applications, a channel that mutates stored strings by duplicating substrings as well as substituting symbols is st…

cs.IT2018★ 27 cited

Reconstruction Codes for DNA Sequences with Uniform Tandem-Duplication Errors

Yonatan Yehezkeally, Moshe Schwartz

DNA as a data storage medium has several advantages, including far greater data density compared to electronic media. We propose that schemes for data storage in the DNA of living…

cs.IT2016★ 17 cited

Limited-Magnitude Error-Correcting Gray Codes for Rank Modulation

Yonatan Yehezkeally, Moshe Schwartz

We construct Gray codes over permutations for the rank-modulation scheme, which are also capable of correcting errors under the infinity-metric. These errors model limited-magnitud…

cs.IT2011★ 52 cited

Snake-in-the-Box Codes for Rank Modulation

Yonatan Yehezkeally, Moshe Schwartz

Motivated by the rank-modulation scheme with applications to flash memory, we consider Gray codes capable of detecting a single error, also known as snake-in-the-box codes. We stud…