The probability of successful allocation of particles in cells (the general case)

Let [p.sub.nN] be the probability of successful allocation of n groups of particles in N cells with the following assumptions: (a) each group contains m particles and has allocation as a general allocation scheme; (b) each cell contains at most r particles from the same group; (c) events connected with different groups are independent. We obtain an asymptotically exact bound of [p.sub.nN] as n, N [right arrow] [infinity] such that n/N is bounded. Applications to problems in error-correcting coding are considered.
UDC 519.212.2+517.537 1. Introduction and Main Result We will consider a general allocation scheme of n independent series of particles in N cells (for an account of such an allocation [...]