5 citations · 5 across the 6 of their papers we have counts for
5 papers · 1 filter
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…
Storage codes and recoverable systems on lines and grids
Alexander Barg, Ohad Elishco, Ryan Gabrys +2
A storage code is an assignment of symbols to the vertices of a connected graph with the property that the value of each vertex is a function of the values of its neighbor…
Finding a Burst of Positives via Nonadaptive Semiquantitative Group Testing
Yun-Han Li, Ryan Gabrys, Jin Sima +2
Motivated by testing for pathogenic diseases we consider a new nonadaptive group testing problem for which: (1) positives occur within a burst, capturing the fact that infected tes…
Non-binary Codes for Correcting a Burst of at Most t Deletions
Shuche Wang, Yuanyuan Tang, Jin Sima +2
The problem of correcting deletions has received significant attention, partly because of the prevalence of these errors in DNA data storage. In this paper, we study the problem of…
Low-redundancy codes for correcting multiple short-duplication and edit errors
Yuanyuan Tang, Shuche Wang, Hao Lou +2
Due to its higher data density, longevity, energy efficiency, and ease of generating copies, DNA is considered a promising storage technology for satisfying future needs. However,…