Title :
Random number approximation problem for discrete memoryless sources
Author :
Oohama, Yasutada
Author_Institution :
Graduate Sch. of Inf. Sci. & Electr. Eng., Kyushu Univ., Fukuoka, Japan
Abstract :
We consider the simulation problem of generating random sequences from an arbitrary prescribed discrete memoryless source (DMS) by using a random sequence from a given DMS. We propose two simple algorithms and give some explicit results for their asymptotic performances
Keywords :
approximation theory; information theory; memoryless systems; random number generation; asymptotic performance; discrete memoryless sources; random number approximation problem; random sequence; random sequence generation; simulation problem; Algorithm design and analysis; Erbium; Performance analysis; Random number generation; Random sequences; Sorting;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866753
