Abstract

Let p 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 nN as n,N →∞ such that n/N is bounded. Applications to problems in error-correcting coding are considered.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call