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

DOI10.1007/s10623-022-01073-9WikidataQ114849702 ScholiaQ114849702MaRDI QIDQ2161417

Khodakhast Bibak, Behrouz Zolfaghari

Publication date: 4 August 2022

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-022-01073-9

zbMATH Keywords

edit distance; Ramanujan sum; deletion correcting code; Levenshtein code; Modular Subset-Sum Problem

Mathematics Subject Classification ID

11P83: Partitions; congruences and congruential restrictions

11D79: Congruences in many variables

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

11B13: Additive bases, including sumsets

11L03: Trigonometric and exponential sums (general theory)