212 citations · 732 across the 56 of their papers we have counts for
4 papers · 1 filter
On Bi-Modal Constrained Coding
Ron M. Roth, Paul H. Siegel
Bi-modal (respectively, multi-modal) constrained coding refers to an encoding model whereby a user input block can be mapped to two (respectively, multiple) codewords. In current s…
Covering Codes using Insertions or Deletions
Andreas Lenz, Cyrus Rashtchian, Paul H. Siegel +1
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the…
Anchor-Based Correction of Substitutions in Indexed Sets
Andreas Lenz, Paul H. Siegel, Antonia Wachter-Zeh +1
Motivated by DNA-based data storage, we investigate a system where digital information is stored in an unordered set of several vectors over a finite alphabet. Each vector begins w…
The Capacity of Count-Constrained ICI-Free Systems
Navin Kashyap, Ron M. Roth, Paul H. Siegel
A Markov chain approach is applied to determine the capacity of a general class of q-ary ICI-free constrained systems that satisfy an arbitrary count constraint.