{"id":"https://openalex.org/W2099933502","doi":"https://doi.org/10.1109/isit.2010.5513679","title":"Generalizing the Blum-Elias method for generating random bits from Markov chains","display_name":"Generalizing the Blum-Elias method for generating random bits from Markov chains","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2099933502","doi":"https://doi.org/10.1109/isit.2010.5513679","mag":"2099933502"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102804953","display_name":"Hongchao Zhou","orcid":"https://orcid.org/0000-0002-9783-0873"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hongchao Zhou","raw_affiliation_strings":["Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","Department of Electrical Engineering, California Institute of Technology, Pasadena 91125, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]},{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena 91125, USA#TAB#","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043861677","display_name":"Jehoshua Bruck","orcid":"https://orcid.org/0000-0001-8474-0812"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jehoshua Bruck","raw_affiliation_strings":["Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","Department of Electrical Engineering, California Institute of Technology, Pasadena 91125, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]},{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena 91125, USA#TAB#","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102804953"],"corresponding_institution_ids":["https://openalex.org/I122411786"],"apc_list":null,"apc_paid":null,"fwci":0.4645,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.74628697,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"43","issue":null,"first_page":"1248","last_page":"1252"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.77052903175354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5151968598365784},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5138154625892639},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.48496556282043457},{"id":"https://openalex.org/keywords/von-neumann-architecture","display_name":"Von Neumann architecture","score":0.4633875787258148},{"id":"https://openalex.org/keywords/random-number-generation","display_name":"Random number generation","score":0.4585570693016052},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4262698292732239},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41877979040145874},{"id":"https://openalex.org/keywords/examples-of-markov-chains","display_name":"Examples of Markov chains","score":0.4118348956108093},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3803257346153259},{"id":"https://openalex.org/keywords/variable-order-markov-model","display_name":"Variable-order Markov model","score":0.37358832359313965},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3444337844848633},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.328808456659317},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1421876847743988},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.06888595223426819}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.77052903175354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5151968598365784},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5138154625892639},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.48496556282043457},{"id":"https://openalex.org/C80469333","wikidata":"https://www.wikidata.org/wiki/Q189088","display_name":"Von Neumann architecture","level":2,"score":0.4633875787258148},{"id":"https://openalex.org/C201866948","wikidata":"https://www.wikidata.org/wiki/Q228206","display_name":"Random number generation","level":2,"score":0.4585570693016052},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4262698292732239},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41877979040145874},{"id":"https://openalex.org/C76408418","wikidata":"https://www.wikidata.org/wiki/Q5419314","display_name":"Examples of Markov chains","level":5,"score":0.4118348956108093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3803257346153259},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.37358832359313965},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3444337844848633},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.328808456659317},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1421876847743988},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.06888595223426819},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2010.5513679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.375.8917","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.375.8917","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.paradise.caltech.edu/hzhou/papers/ISIT2010/markov.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1987434335","https://openalex.org/W1990359855","https://openalex.org/W2026900961","https://openalex.org/W2047647044","https://openalex.org/W2083505010","https://openalex.org/W2099528673","https://openalex.org/W2115963425","https://openalex.org/W2150477349","https://openalex.org/W2162346812","https://openalex.org/W2996041333","https://openalex.org/W4240760711","https://openalex.org/W6647891801"],"related_works":["https://openalex.org/W50519898","https://openalex.org/W190459708","https://openalex.org/W3166133680","https://openalex.org/W3023326395","https://openalex.org/W2989366387","https://openalex.org/W2987631717","https://openalex.org/W4313020346","https://openalex.org/W2075517632","https://openalex.org/W1989844119","https://openalex.org/W1493775604"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,65,141],"random":[3,9,37,60,99,156],"number":[4],"generation":[5,140],"from":[6,101,117,158],"an":[7,94,159],"uncorrelated":[8],"source":[10],"(of":[11,68],"unknown":[12,69],"probability":[13,70],"distribution)":[14],"dates":[15],"back":[16],"to":[17,31,126],"von":[18,25],"Neumann's":[19,26],"1951":[20],"work.":[21],"Elias":[22,52],"(1972)":[23],"generalized":[24],"scheme":[27],"and":[28,53,132,169],"showed":[29],"how":[30],"achieve":[32],"optimal":[33],"efficiency":[34],"in":[35,62,106,165],"unbiased":[36,59,142,155],"bits":[38,61,100,157],"generation.":[39],"Hence,":[40],"a":[41,145],"natural":[42],"question":[43],"is":[44,114],"what":[45],"if":[46],"the":[47,63,149,171],"sources":[48,67],"are":[49,82],"correlated?":[50],"Both":[51],"Samueleson":[54],"proposed":[55,80],"methods":[56,81],"for":[57,96,138],"generating":[58,98],"case":[64],"correlated":[66],"distribution),":[71],"specifically,":[72],"they":[73],"considered":[74],"finite":[75,103,129,161],"Markov":[76,104,130,162],"chains.":[77],"However,":[78],"their":[79],"not":[83],"efficient":[84,139],"(Samueleson)":[85],"or":[86],"have":[87],"implementation":[88],"difficulties":[89],"(Elias).":[90],"Blum":[91],"(1986)":[92],"devised":[93],"algorithm":[95,125,152],"efficiently":[97],"degree-2":[102],"chains":[105,131],"expected":[107,166],"linear":[108,167],"time,":[109],"however,":[110],"his":[111],"beautiful":[112],"method":[113,137],"still":[115],"far":[116],"optimality.":[118],"In":[119],"this":[120],"paper,":[121],"we":[122,147],"generalize":[123],"Blum's":[124],"arbitrary":[127,160],"degree":[128],"combine":[133],"it":[134],"with":[135],"Elias's":[136],"bits.":[143],"As":[144],"result,":[146],"provide":[148],"first":[150],"known":[151],"that":[153],"generates":[154],"chain,":[163],"operates":[164],"time":[168],"achieves":[170],"information-theoretic":[172],"upper":[173],"bound":[174],"on":[175],"efficiency.":[176]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}