TY - JOUR
T1 - The Modular Subset-Sum Problem and the size of deletion correcting codes
AU - Bibak, Khodakhast
AU - Zolfaghari, Behrouz
N1 - Funding Information:
The authors would like to thank the editor and the referees for carefully reading the paper, and for their useful comments which helped improve the paper.
Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2022
Y1 - 2022
N2 - 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.
AB - 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.
KW - Deletion correcting code
KW - Edit distance
KW - Levenshtein code
KW - Modular Subset-Sum Problem
KW - Ramanujan sum
UR - http://www.scopus.com/inward/record.url?scp=85132722916&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85132722916&partnerID=8YFLogxK
U2 - 10.1007/s10623-022-01073-9
DO - 10.1007/s10623-022-01073-9
M3 - Article
AN - SCOPUS:85132722916
SN - 0925-1022
JO - Designs, Codes, and Cryptography
JF - Designs, Codes, and Cryptography
ER -