乱数生成と情報源符号化(<特集>データ圧縮)

概要

論文の詳細を見る
We discuss the following problems of random number generation. Problem 1: How many fair coin flips can we generate from a discrete random variable X with distribution p=(p_1, p_2, …, P_M)? Or, generation of unbiased N-sided coin from an information source X (intrinsic randomness problem). Problem 2: How to generate a discrete random variable Y∈{1, 2, …, N} with probalility q=(q_1, q_2, …, q_N) by using a fair coin. Or, generation of random number Y by using an unbiased M-sided coin (resolvability problem). How many fair coin flips does it take to generate a random variable X? Problem 3: How to generate a discrete random variable Y∈{1, 2, …, N} with probability q=(q_1, q_2, …, q_N) from a discrete random variable X with probability p=(p_1, p_2, …, P_M). Lastly, we discuss the relations between the problems above and source coding problems.
一般社団法人日本応用数理学会の論文
1998-06-15