Deletion correcting codes meet the Littlewood-Offord problem

DOI10.1007/s10623-020-00787-yzbMath1480.94031OpenAlexW3076974709MaRDI QIDQ2205891

Khodakhast Bibak

Publication date: 21 October 2020

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

Full work available at URL: https://doi.org/10.1007/s10623-020-00787-y

zbMATH Keywords

linear congruenceLittlewood-Offord problemdeletion correcting codesLevenshtein code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Congruences in many variables (11D79) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Trigonometric and exponential sums (general theory) (11L03)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restricted linear congruences
• Projections, entropy and sumsets
• An application of coding theory to estimating Davenport constants
• Explicit constructions of RIP matrices and related problems
• The restricted isometry property and its implications for compressed sensing
• Solution of the Littlewood-Offord problem in high dimensions
• Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes
• Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller
• Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
• Entropy and set cardinality inequalities for partition-determined functions
• New Multiple Insertion/Deletion Correcting Codes for Non-Binary Alphabets
• Spectral enumerators for certain additive-error-correcting codes over integer alphabets
• Decoding by Linear Programming
• Sumsets and entropy
• The constantinrao construction for binary asymmetric error-correcting codes
• On group-theoretic codes for asymmetric channels
• ON A PROBLEM RELATED TO ONE OF LITTLEWOOD AND OFFORD
• On multiple insertion/deletion correcting codes
• Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction
• On the distribution of sums of residues
• Sumset and Inverse Sumset Theory for Shannon Entropy
• Codes Correcting a Burst of Deletions or Insertions
• Stable signal recovery from incomplete and inaccurate measurements