Signature coding over multiple access OR channel

The problem of signature coding for a multiple access OR channel is studied. For the binomial model of the activity of the users, the Kautz-Singleton code and a random code are compared. The minimal code length of the random code is proved to be better than the existing bounds.