The Modular Subset-Sum Problem and the size of deletion correcting codes
DOI10.1007/s10623-022-01073-9OpenAlexW4283361514WikidataQ114849702 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
Partitions; congruences and congruential restrictions (11P83) Congruences in many variables (11D79) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Additive bases, including sumsets (11B13) Trigonometric and exponential sums (general theory) (11L03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT
- Restricted linear congruences
- Structural approach to subset sum problems
- A survey of results for deletion channels and related synchronization channels
- Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes
- Deletion correcting codes meet the Littlewood-Offord problem
- Ramanujan sums as supercharacters
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Subset sums in abelian groups
- New Multiple Insertion/Deletion Correcting Codes for Non-Binary Alphabets
- Low-Complexity Interactive Algorithms for Synchronization From Deletions, Insertions, and Substitutions
- Spectral enumerators for certain additive-error-correcting codes over integer alphabets
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Introduction to Information Retrieval
- New Generic Algorithms for Hard Knapsacks
- The constantinrao construction for binary asymmetric error-correcting codes
- On group-theoretic codes for asymmetric channels
- Biological Sequence Analysis
- On multiple insertion/deletion correcting codes
- Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- Reducibility among Combinatorial Problems
- Correcting a Single Indel/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality
- Coding for Sequence Reconstruction for Single Edits
- Fast Modular Subset Sum using Linear Sketching
- Codes Correcting a Burst of Deletions or Insertions
- A Deterministic Polynomial-Time Protocol for Synchronizing From Deletions
- An addition theorem modulo p
This page was built for publication: The Modular Subset-Sum Problem and the size of deletion correcting codes
