Pages that link to "Item:Q4575716"
From MaRDI portal
The following pages link to Efficient Low-Redundancy Codes for Correcting Multiple Deletions (Q4575716):
Displaying 15 items.
- Duplication-correcting codes (Q1727344) (← links)
- Real-time error correction codes for deletable errors (Q2080010) (← links)
- Decoding algorithms of monotone codes and azinv codes and their unified view (Q2099156) (← links)
- Deletion correcting codes meet the Littlewood-Offord problem (Q2205891) (← links)
- Constructions of multi-permutation codes correcting a single burst of deletions (Q2701501) (← links)
- (Q3514057) (← links)
- On multiple insertion/deletion correcting codes (Q4544787) (← links)
- Efficient Low-Redundancy Codes for Correcting Multiple Deletions (Q4575716) (← links)
- An improved bound on the fraction of correctable deletions (Q4575717) (← links)
- Efficiently decodable codes for the binary deletion channel (Q5002653) (← links)
- (Q5375523) (redirect page) (← links)
- Information-Theoretic Foundations of DNA Data Storage (Q5863762) (← links)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
- Efficient Linear and Affine Codes for Correcting Insertions/Deletions (Q6156613) (← links)
- Deterministic document exchange protocols and almost optimal binary codes for edit errors (Q6551260) (← links)