Strongly universal hashing and identification codes via channels

This article shows that /spl epsiv/-almost strongly universal classes of hash functions can yield better explicit constructions of identification codes via channels (ID codes) and identification plus transmission codes (IT codes) than the previous explicit constructions of Verdu and Wei (1993).