After being introduced by Shannon as a measure of disorder and unavailable information,
the notion of entropy has found its applications in a broad range of scientific disciplines. In …

In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of
arithmetic functions, we give an explicit formula for the number of solutions of the linear …

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 …

Universal hash functions, discovered by Carter and Wegman in 1979, are of great
importance in computer science with many applications. MMH⁎ is a well-known△-universal …

Congruences are ubiquitous in computer science, engineering, mathematics, and related
areas. Developing techniques for finding (the number of) solutions of congruences is an …

Many concurrency platforms offer a processor oblivious model of computation, where the
scheduler dynamically distributes work across threads. While this is convenient, it introduces …

In this paper, we first give explicit formulas for the number of solutions of unweighted linear
congruences with distinct coordinates. Our main tools are properties of Ramanujan sums …

We introduce a general class of codes which includes several well-known classes of
deletion/insertion correcting codes as special cases. For example, the Helberg code, the …

This book studies the intersection between cryptography and AI, highlighting the significant
cross-impact and potential between the two technologies. The authors first study the …

We derive an explicit expression for the weight enumerator of a general class of codes
which includes several classes of deletion correcting codes, such as Helberg, Levenshtein …