A recursive solution to an occupancy problem resulting from TDM radio communication application

Abstract

[[abstract]]In this paper we treat an occupancy problem: the probability that m out of n boxes each have exactly one ball resulting from distributing k balls into n boxes. The solution to this problem is given by a set of recursive expressions. By translating these formulae into a computer program, one can easily obtain the numerical results