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 …

Universal hashing, discovered by Carter and Wegman in 1979, has many important
applications in computer science. MMH∗, which was shown to be Δ-universal by Halevi and …

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 …

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

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 …

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 …

We address three questions posed by K. Bibak (2020), and generalize some results of K.
Bibak, DN Lehmer and KG Ramanathan on solutions of linear congruences\(\sum_ {i= 1} …

Abstract Recently, Grynkiewicz et al.(2013), using tools from additive combinatorics and
group theory, proved necessary and sufficient conditions under which the linear congruence …

Universal hashing, discovered by Carter and Wegman in 1979, has many important
applications in computer science. As a well known family, one can mention MMH* which …