4 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…
Type-two Iteration with Bounded Query Revision
Bruce M. Kapron, Florian Steinberg
Motivated by recent results of Kapron and Steinberg (LICS 2018) we introduce new forms of iteration on length in the setting of applied lambda-calculi for higher-type poly-time com…