Approaches to an occupancy problem resulting from MFSK systems with diversity and majority vote

Abstract

[[abstract]]This paper is concerned with a combinatorial probability problem resulting from an M-ary frequency shift keying (MFSK) system with diversity transmissions and majority vote. This problem is equivalent to an occupancy problem concerning the probability that m boxes each contain exactly r balls and each of the remaining n−m boxes has less than r balls resulting from distributing k balls into n boxes. Two approaches based on recursive algorithms to the problem are derived and their computational efficiencies are compared