The Modular Subset-Sum Problem and the size of deletion correcting codes

Khodakhast Bibak*, Behrouz Zolfaghari

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
JournalDesigns, Codes, and Cryptography
DOIs
Publication statusAccepted/In press - 2022

Keywords

  • Deletion correcting code
  • Edit distance
  • Levenshtein code
  • Modular Subset-Sum Problem
  • Ramanujan sum

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'The Modular Subset-Sum Problem and the size of deletion correcting codes'. Together they form a unique fingerprint.

Cite this