A survey of results for deletion channels and related synchronization channels
From MaRDI portal
Publication:980780
DOI10.1214/08-PS141zbMath1189.94058MaRDI QIDQ980780
Publication date: 29 June 2010
Published in: Probability Surveys (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/224558
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Synchronization error-correcting codes (94B50)
Related Items (11)
The Modular Subset-Sum Problem and the size of deletion correcting codes ⋮ Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees ⋮ Computation of channel capacity based on self-concordant functions ⋮ Unnamed Item ⋮ A Binary Deletion Channel With a Fixed Number of Deletions ⋮ Optimal mean-based algorithms for trace reconstruction ⋮ Hidden words statistics for large patterns ⋮ Peeling decoding of LDPC codes with applications in compressed sensing ⋮ Subpolynomial trace reconstruction for random strings and arbitrary deletion probability ⋮ Statistically consistent and computationally efficient inference of ancestral DNA sequences in the TKF91 model under dense taxon sampling ⋮ Reconstructing trees from traces
This page was built for publication: A survey of results for deletion channels and related synchronization channels
