5 papers · 1 filter
Substring Edit Correcting Codes and Optimal Single Burst-Deletion Correcting Codes
Zuo Ye, Gennian Ge
A -substring edit in a sequence first deletes a substring of length at most , and then inserts a sequence of length at most at the same position. A code that can correct…
Polynomially Improved Lower Bounds for Trifferent Codes via Locally Sparse -Uniform Hypergraphs
Xuejiao Han, Yubo Sun, Gennian Ge
A ternary code is \emph{trifferent} if every three distinct codewords have a coordinate in which their symbols are pairwise distinct. Let be the maximum size of a trifferent…
New Results on Limited Magnitude Error Correcting Codes
Zhiyu Yuan, Tingting Chen, Rongquan Feng +1
This paper investigates the existence, construction and classification of limited magnitude error-correcting codes, with a focus on splitter sets and their connections to group spl…
Bounds and Constructions of Codes for Ordered Composite DNA Sequences
Zuo Ye, Yuling Li, Zhaojun Lan +1
This paper extends the foundational work of Dollma \emph{et al}. on codes for ordered composite DNA sequences. We consider the general setting with an alphabet of size and a re…
On the Palindromic/Reverse-Complement Duplication Correcting Codes
Yubo Sun, Gennian Ge
Motivated by applications in in-vivo DNA storage, we study codes for correcting duplications. A reverse-complement duplication of length is the insertion of the reversed and co…