The Modular Subset-Sum Problem and the size of deletion correcting codes (Q2161417)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Modular Subset-Sum Problem and the size of deletion correcting codes |
scientific article |
Statements
The Modular Subset-Sum Problem and the size of deletion correcting codes (English)
0 references
4 August 2022
0 references
edit distance
0 references
Levenshtein code
0 references
deletion correcting code
0 references
Ramanujan sum
0 references
Modular Subset-Sum Problem
0 references
0 references
0 references
0 references
0 references
