20 citations · 92 across the 14 of their papers we have counts for
14 papers
MMH* with arbitrary modulus is always almost-universal
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
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…
Unweighted linear congruences with distinct coordinates and the Varshamov--Tenengolts codes
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
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 su…
The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
Let be the ring of Gaussian integers modulo a positive integer . Very recently, Camarero and Martínez [IEEE Trans. Inform. Theory, {\bf 62} (2016), 1183--1192], showed…
Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes
Khodakhast Bibak, Olgica Milenkovic
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 Levensht…
A generalization of Schönemann's theorem via a graph theoretic method
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
Recently, Grynkiewicz et al. [{\it Israel J. Math.} {\bf 193} (2013), 359--398], using tools from additive combinatorics and group theory, proved necessary and sufficient condition…
On a restricted linear congruence
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
Let , , and be all positive divisors of . For , define ${\cal C}_l:=\lbrace 1 \leqslant x\le…