On the decoding error weight of one or two deletion channels
From MaRDI portal
Cites work
- A binary deletion channel with a fixed number of deletions
- A faster algorithm computing string edit distances
- A linear space algorithm for computing maximal common subsequences
- A linear-time algorithm for finding approximate shortest common superstrings
- A Simple Lower Bound for the Capacity of the Deletion Channel
- A survey of results for deletion channels and related synchronization channels
- Achievable Rates for Channels With Deletions and Insertions
- Algorithms for subsequence combinatorics
- Algorithms for the Longest Common Subsequence Problem
- An Improved Bound on the Fraction of Correctable Deletions
- Average-case reconstruction for the deletion channel: subpolynomially many traces suffice
- Capacity Upper Bounds for Deletion-type Channels
- Codes Correcting a Burst of Deletions or Insertions
- Codes Correcting Two Deletions
- Coding for Racetrack Memories
- Coding for Sequence Reconstruction for Single Edits
- Computing a longest common subsequence for a set of strings
- Deletion Codes in the High-Noise and High-Rate Regimes
- Directly Lower Bounding the Information Capacity for Channels With I.I.D. Deletions and Duplications
- Efficient low-redundancy codes for correcting multiple deletions
- Efficient reconstruction of sequences
- Efficient reconstruction of sequences from their subsequences of supersequences
- Error graphs and the reconstruction of elements in groups
- Fast linear-space computations of longest common subsequences
- scientific article; zbMATH DE number 5764889 (Why is no real title available?)
- scientific article; zbMATH DE number 6900644 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels
- Linear approximation of shortest superstrings
- List Decoding of Insertions and Deletions
- Matching Sequences under Deletion/Insertion Constraints
- Novel Bounds on the Capacity of the Binary Deletion Channel
- On Coding Over Sliced Information
- On information transmission over a finite buffer channel
- On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric
- Optimal codes detecting deletions in concatenated binary strings applied to trace reconstruction
- Optimal mean-based algorithms for trace reconstruction
- Optimally resilient codes for list-decoding from insertions and deletions
- Polar Codes for the Deletion Channel: Weak and Strong Polarization
- Reconstructing strings from random traces
- Reconstruction of a graph from 2-vicinities of its vertices
- The string merging problem
- Trace reconstruction with \(\exp(O(n^{1/3}))\) samples
- Upper Bounds on the Capacity of Deletion Channels Using Channel Fragmentation
- Using Reed–Muller ${\hbox{RM}}\,(1, m)$ Codes Over Channels With Synchronization and Substitution Errors
This page was built for publication: On the decoding error weight of one or two deletion channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7345657)
