Deletion correcting codes meet the Littlewood-Offord problem

DOI10.1007/s10623-020-00787-yzbMath1480.94031MaRDI 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 congruence; Littlewood-Offord problem; deletion correcting codes; Levenshtein code

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94B05: Linear codes (general theory)

11D79: Congruences in many variables

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

11L03: Trigonometric and exponential sums (general theory)