{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:50:13Z","timestamp":1777704613185,"version":"3.51.4"},"reference-count":19,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T00:00:00Z","timestamp":1532390400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2018,12,24]]},"abstract":"<jats:p>In a recent work, Bernardini and Rinaldo generalize and attempt to improve upon Elias method to obtain unbiased random bits from a geometric distribution resulted from a Poisson process. As a response, we analyse the output rates of their method and compare with the original binary Elias method applied on a Bernoulli process resulted from the same Poisson process, which turns out to be much simpler to implement and to have a higher output rate.<\/jats:p>","DOI":"10.3233\/jifs-169835","type":"journal-article","created":{"date-parts":[[2018,7,27]],"date-time":"2018-07-27T19:29:14Z","timestamp":1532719754000},"page":"5939-5946","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Generation of random bits from Poisson processes"],"prefix":"10.1177","volume":"35","author":[{"given":"Sung-il","family":"Pae","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Hongik University, 94 Wausan-ro, Mapo-gu, Seoul, Korea"}]}],"member":"179","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"crossref","unstructured":"BernardiniR. and RinaldoR. Unbiased random sequences from measurements of poisson processes in Proceedings of IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP)2014 pp. 8188\u20138192.","DOI":"10.1109\/ICASSP.2014.6855197"},{"key":"e_1_3_2_3_2","unstructured":"CoverT.M. and ThomasJ.A. Elements of information theory (2. ed.) Wiley 2006."},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90072-6"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177692552"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.841170"},{"key":"e_1_3_2_7_2","unstructured":"KnuthD.E. The Art of Computer Programming Combinatorial Algorithms Part 1 volume 4A. Addison-Wesley 2011."},{"key":"e_1_3_2_8_2","first-page":"357","volume-title":"Algorithms and Complexity: New Directions and Recent Results. Proceedings of a Symposium","author":"Knuth D.E.","year":"1976","unstructured":"KnuthD.E. and YaoA.C.-C., The complexity of nonuniform random number generation. In JosephF. Traub, editor, Algorithms and Complexity: New Directions and Recent Results. Proceedings of a Symposium, NewYork, NY, 1976, pp. 357\u2013428. Carnegie-Mellon University, Computer Science Department, Academic Press. Reprinted in Knuth\u2019s Selected Papers on Analysis of Algorithms (CSLI, 2000)."},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2012.12.012"},{"issue":"2","key":"e_1_3_2_10_2","article-title":"A generalization of Peres\u2019s algorithm for generating random bits from loaded dice","volume":"61","author":"Pae S.","year":"2015","unstructured":"PaeS., A generalization of Peres\u2019s algorithm for generating random bits from loaded dice, IEEE Transactions on Information Theory61(2) (2015).","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","unstructured":"PaeS. Binarizations in random number generation In IEEE International Symposium on Information Theory ISIT 2016 Barcelona Spain 2016 pp. 2923\u20132927.","DOI":"10.1109\/ISIT.2016.7541834"},{"key":"e_1_3_2_12_2","unstructured":"PaeS. and LouiM.C. Optimal random number generation from a biased coin in Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2005) pp. 1079\u20131088."},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883555"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176348543"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.841190"},{"issue":"324","key":"e_1_3_2_16_2","article-title":"Constructing an unbiased random sequence","volume":"63","author":"Samuelson P.A.","year":"1968","unstructured":"SamuelsonP.A., Constructing an unbiased random sequence, Journal of American Statistical Sociaety63(324) (1968).","journal-title":"Journal of American Statistical Sociaety"},{"key":"e_1_3_2_17_2","volume-title":"The Mathematical Theory of Communication","author":"Shannon C.E.","year":"1964","unstructured":"ShannonC.E., WarrenW., The Mathematical Theory of Communication, The University of Illinois Press, Urbana. 1964."},{"key":"e_1_3_2_18_2","volume-title":"Introduction to Algorithms","author":"Stein C.","year":"2001","unstructured":"SteinC., CormenT.H., RivestR.L., LeisersonC.E., Introduction to Algorithms, MIT Press, 2nd edition, 2001.","edition":"2"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993384"},{"key":"e_1_3_2_20_2","first-page":"36","volume-title":"Monte Carlo Method, Applied Mathematics Series","author":"von Neumann J.","year":"1951","unstructured":"von NeumannJ., Various techniques for use in connection with random digits. Notes by ForsytheG.E.. In Monte Carlo Method, Applied Mathematics Series, volume 12, pp. 36\u201338. U.S. National Bureau of Standards, Washington D.C., 1951. Reprinted in von Neumann\u2019s, Collected Works5 (Pergammon Press, 1963), pp. 768\u2013770."}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169835","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-169835","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:41:37Z","timestamp":1777455697000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-169835"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,24]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12,24]]}},"alternative-id":["10.3233\/JIFS-169835"],"URL":"https:\/\/doi.org\/10.3233\/jifs-169835","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,24]]}}}