From the 1 of 7 linked papers with an AI index.
7 papers
More on Codes for Combinatorial Composite DNA
Zuo Ye, Omer Sabary, Ryan Gabrys +2
In this paper, we focus on constructions of unique-decodable/list-decodable on the recently studied -composite-asymmetric error-correcting codes (-CAECCs). Let be…
Quantum Codes with Transversal Gates and Sublinear -Stabilizers
Ohad Elishco, Itzhak Tamo
The paper presents a construction of asymmetric quantum CSS codes that support transversal CCZ gates, using algebraic expander codes to achieve linear X-distance and sublinear Z-di…
Central Limit Theorem for Mutation Systems
Liav Koram, Ohad Elishco
DNA-based storage has emerged as a promising alternative to traditional data storage methods, offering unmatched advantages in data density, longevity, and sustainability. Two main…
Coding for Ordered Composite DNA Sequences
Besart Dollma, Ohad Elishco, Eitan Yaakobi
To increase the information capacity of DNA storage, composite DNA letters were introduced. We propose a novel channel model for composite DNA in which composite sequences are deco…
On Multidimensional 2-Weight-Limited Burst-Correcting Codes
Hagai Berend, Ohad Elishco, Moshe Schwartz
We consider multidimensional codes capable of correcting a burst error of weight at most . When two positions are in error, the burst limits their relative position. We study th…
Codes Correcting Two Bursts of Exactly Deletions
Zuo Ye, Yubo Sun, Wenjun Yu +2
In this paper, we investigate codes designed to correct two bursts of deletions, where each burst has a length of exactly , where . The previous best construction, achieved…