List Decoding of Deletions Using Guess & Check Codes
Serge Kas Hanna, Salim El Rouayheb

TL;DR
This paper analyzes the list decoding performance of Guess & Check codes for multiple deletions, showing that the list size tends to one on average and remains bounded for large message lengths, with supporting simulations.
Contribution
It investigates the list decoding capabilities of GC codes, revealing their asymptotic optimality and bounded list size for constant deletions, which was not previously established.
Findings
Average list size approaches 1 as message length increases
Maximum list size can be bounded independently of message length
Numerical simulations support theoretical results
Abstract
Guess & Check (GC) codes are systematic binary codes that can correct multiple deletions, with high probability. GC codes have logarithmic redundancy in the length of the message , and the encoding and decoding algorithms of these codes are deterministic and run in polynomial time for a constant number of deletions . The unique decoding properties of GC codes were examined in a previous work by the authors. In this paper, we investigate the list decoding performance of these codes. Namely, we study the average size and the maximum size of the list obtained by a GC decoder for a constant number of deletions . The theoretical results show that: (i) the average size of the list approaches as grows; and (ii) there exists an infinite sequence of GC codes indexed by , whose maximum list size in upper bounded by a constant that is independent of . We also…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced biosensing and bioanalysis techniques · DNA and Biological Computing · Error Correcting Code Techniques
