Sequence reconstruction problem for deletion channels: a complete asymptotic solution

DOI10.1016/j.jcta.2024.105980MaRDI QIDQ6655391

Han Mao Kiah, Keshav Goyal, Van Long Phuoc Pham

Publication date: 23 December 2024

Published in: (Search for Journal in Brave)

zbMATH Keywords

deletion-correcting codessequence reconstruction problemLevenshtein's distance

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms for subsequence combinatorics
• Efficient reconstruction of sequences
• Coding for Racetrack Memories
• On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions
• Coding Over Sets for DNA Storage
• Exact Reconstruction From Insertions in Synchronization Codes
• Efficient reconstruction of sequences from their subsequences of supersequences
• Correcting Deletions With Multiple Reads

This page was built for publication: Sequence reconstruction problem for deletion channels: a complete asymptotic solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655391)