Sequence reconstruction problem for deletion channels: A complete asymptotic solution

Sequence reconstruction problem for deletion channels: A complete asymptotic solution

Transmit a codeword ▪, that belongs to an (ℓ−1)-deletion-correcting code of length n, over a t-deletion channel for some 1≤ℓ≤t

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of combinatorial theory. Series A 2025-04, Vol.211, p.105980, Article 105980
Hauptverfasser: Pham, Van Long Phuoc, Goyal, Keshav, Kiah, Han Mao
Format: Artikel
Sprache:eng
Schlagworte:
Deletion-correcting codes
Levenshtein's distance
Sequence reconstruction problem
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Transmit a codeword ▪, that belongs to an (ℓ−1)-deletion-correcting code of length n, over a t-deletion channel for some 1≤ℓ≤t
ISSN:0097-3165
DOI:10.1016/j.jcta.2024.105980