Pages that link to "Item:Q980780"
From MaRDI portal
The following pages link to A survey of results for deletion channels and related synchronization channels (Q980780):
Displaying 13 items.
- Computation of channel capacity based on self-concordant functions (Q415822) (← links)
- Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees (Q1663866) (← links)
- Optimal mean-based algorithms for trace reconstruction (Q1737958) (← links)
- Peeling decoding of LDPC codes with applications in compressed sensing (Q1793437) (← links)
- Hidden words statistics for large patterns (Q2030762) (← links)
- Subpolynomial trace reconstruction for random strings and arbitrary deletion probability (Q2035747) (← links)
- Reconstructing trees from traces (Q2075329) (← links)
- The Modular Subset-Sum Problem and the size of deletion correcting codes (Q2161417) (← links)
- Statistically consistent and computationally efficient inference of ancestral DNA sequences in the TKF91 model under dense taxon sampling (Q2299336) (← links)
- Synchronization strings: list decoding for insertions and deletions (Q5002755) (← links)
- A Binary Deletion Channel With a Fixed Number of Deletions (Q5364238) (← links)
- On the size distribution of the fixed-length Levenshtein balls with radius one (Q6587203) (← links)
- Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers (Q6612803) (← links)
