Metrics
10 Record Views
Journal article
The Modular Subset-Sum Problem and the size of deletion correcting codes
Designs, codes, and cryptography, Vol.90(8), pp.1721-1734
08/2022
Web of Science ID: WOS:000815470500002
Abstract
In this paper, using some results on the deletion correcting codes, we give an equivalent form of the Modular Subset-Sum Problem which is of significant importance in computer science and (quantum) cryptography. We also, using Ramanujan sums and their properties, give an explicit formula for the size of the Levenshtein code which has found many interesting applications, for examples, in studying DNA-based data storage and distributed message synchronization.
Related links
Details
- Title
- The Modular Subset-Sum Problem and the size of deletion correcting codes
- Publication Details
- Designs, codes, and cryptography, Vol.90(8), pp.1721-1734
- Resource Type
- Journal article
- Publisher
- Springer Nature
- Number of pages
- 14
- Copyright
- © 2022, The Author(s), under exclusive licence to Springer Science Business Media, LLC, part of Springer Nature
- Identifiers
- WOS:000815470500002; 99381494158006600
- Academic Unit
- Cybersecurity and Information Technology; Hal Marcus College of Science and Engineering
- Language
- English