Error-Correction Techniques in Coding Theory

The field of coding theory is moving towards developing innovative error-correction techniques to mitigate errors in various applications, including storage and communication systems. Recent research has focused on designing efficient codes and decoders that can correct insertions, deletions, and substitutions, which are common types of errors in these systems. Notably, advancements in list recovery and list decoding have enabled the development of efficient codes for correcting multiple errors. Furthermore, new approaches to constrained coding have been proposed, allowing for more versatile and efficient encoding and decoding methods. Additionally, research on DNA-based data storage has led to the development of novel encoding paradigms, such as DNA Tails, which can encode nonbinary symbols at nicking sites.

Some noteworthy papers in this area include: The paper on Decoding Insertions/Deletions via List Recovery, which presents a new approach to reducing the problem of decoding insertions and deletions to that of list recovery. The paper on DNA Tails for Molecular Flash Memory, which proposes a novel encoding paradigm for DNA-based data storage. The paper on Correcting Multiple Substitutions in Nanopore-Sequencing Reads, which establishes bounds on the minimum redundancy required for error-correcting constructions in nanopore sequencing.

Sources

A Single-Bit Redundancy Framework for Multi-Dimensional Parametric Constraints

On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes

Alternating and non-alternating deterministic Markov games

Decoding Insertions/Deletions via List Recovery

Correcting Multiple Substitutions in Nanopore-Sequencing Reads

DNA Tails for Molecular Flash Memory

Binary Reconstruction Codes for Correcting One Deletion and One Substitution

The minimum distance of the antiprimitive BCH code with designed distance 3

Bounds on $k$-hash distances and rates of linear codes

Built with on top of