More on Codes for Combinatorial Composite DNA

2026-08-08

AI Summary

This work addresses (t,e)-composite asymmetric errors in combinatorial composite DNA storage, where up to t rows are corrupted with at most e bit-flips from 1→0 per row. The authors construct low-redundancy uniquely decodable and list-decodable error-correcting codes by integrating combinatorial design, weak $B_e$-set constructions, algebraic coding, and list decoding techniques. They propose a novel coding scheme achieving redundancy at most $(t-1)\log m + O(1)$, which is optimal for the (2,e) case. Moreover, constant redundancy is attained when the list size is $t!$ or exponential in the parameters. Notably, for the (3,2) setting with list size 2, the redundancy is reduced to $\log m + O(1)$, closely approaching the theoretical lower bound.

Abstract

In this paper, we focus on constructions of unique-decodable/list-decodable on the recently studied $(t,e)$-composite-asymmetric error-correcting codes ($(t,e)$-CAECCs). Let $X$ be an $m\times n$ binary matrix, in which each row has Hamming weight $w$. When at most $t$ rows of $X$ suffer from errors and in each of these erroneous rows, there are at most $e$ $1 \to 0$ errors, we say that a $(t,e)$-composite-asymmetric-error occurs in $X$. For general $m,n,w,t,e$, we propose new constructions of $(t,e)$-CAECCs with redundancy at most $(t-1)\log(m)+O(1)$, where $O(1)$ is a number independent of the code-length $m$. In particular, this gives a class of $(2,e)$-CAECCs that are optimal in terms of their redundancy. %(in terms of redundancy, regarded as a function of the number of rows $m$) s. When $m$ is a prime power, the redundancy can be further reduced to $(t-1)\log(m)-O(\log(m))$. To further increase the size of these codes, we introduce a combinatorial object called a weak $B_e$-sets. When $e=w$, we show an efficient way to encode/decode our codes. At last, we investigate how much we can gain if we relax the requirement of uniquely decoding to list-decoding. It is shown that when the list size is $t!$ or an exponential function of $t$, there are list-decodable $(t,e)$-CAECCs with constant redundancy. When the list size is two, we show that there are list-decodable $(3,2)$-CAECCs with redundancy $\log(m)+O(1)$.

Problem

• composite-asymmetric error
• error-correcting codes
• unique decoding
• list decoding
• redundancy

Innovation

• composite-asymmetric error-correcting codes
• redundancy optimization
• weak B_e-sets
• list-decoding
• efficient encoding/decoding