Back to Search
Start Over
The Modular Subset-Sum Problem and the size of deletion correcting codes.
- Source :
- Designs, Codes & Cryptography; Aug2022, Vol. 90 Issue 8, p1721-1734, 14p
- Publication Year :
- 2022
-
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. [ABSTRACT FROM AUTHOR]
- Subjects :
- MODULAR forms
DATA warehousing
COMPUTER science
CRYPTOGRAPHY
SYNCHRONIZATION
Subjects
Details
- Language :
- English
- ISSN :
- 09251022
- Volume :
- 90
- Issue :
- 8
- Database :
- Complementary Index
- Journal :
- Designs, Codes & Cryptography
- Publication Type :
- Academic Journal
- Accession number :
- 158278438
- Full Text :
- https://doi.org/10.1007/s10623-022-01073-9