Efficient generation of a discrete probability distribution is ofcurrent interest in areas like cryptography and random numbergeneration. This paper revisits some known homophonic coding techniques anddiscusses their application in random number generation. Both standard and constrained homophonic coding are considered. Three algorithms are given for generating adiscrete probability distribution using one or more biased coins. CNPqThis approach contributes an alternative solution to the classicalproblem of generating a discrete probability distribution usingbiased coins.