{"id":"https://openalex.org/W2022843495","doi":"https://doi.org/10.1109/isit.2005.1523737","title":"Approximations for the entropy rate of a hidden Markov process","display_name":"Approximations for the entropy rate of a hidden Markov process","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2022843495","doi":"https://doi.org/10.1109/isit.2005.1523737","mag":"2022843495"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523737","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523737","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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/A5006239162","display_name":"Erik Ordentlich","orcid":null},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"E. Ordentlich","raw_affiliation_strings":["Hewlett Packard Laboratories, Palo Alto, CA, USA","Hewlett-Packard Laboratories, Palo Alto. Ca#TAB#"],"affiliations":[{"raw_affiliation_string":"Hewlett Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]},{"raw_affiliation_string":"Hewlett-Packard Laboratories, Palo Alto. Ca#TAB#","institution_ids":["https://openalex.org/I1324840837"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043344688","display_name":"Tsachy Weissman","orcid":"https://orcid.org/0009-0008-1099-691X"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. Weissman","raw_affiliation_strings":["Department of Electrical Engineering, University of Stanford, Stanford, CA, USA","Stanford University"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Stanford, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006239162"],"corresponding_institution_ids":["https://openalex.org/I1324840837"],"apc_list":null,"apc_paid":null,"fwci":1.3466,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.81317204,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"17","issue":null,"first_page":"2198","last_page":"2202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.7654072046279907},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.6193183660507202},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5909299850463867},{"id":"https://openalex.org/keywords/entropy-rate","display_name":"Entropy rate","score":0.5854824185371399},{"id":"https://openalex.org/keywords/maximum-entropy-markov-model","display_name":"Maximum-entropy Markov model","score":0.5074746012687683},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5059639811515808},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.49220648407936096},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48987430334091187},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.45350953936576843},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41512805223464966},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.39763686060905457},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3745373487472534},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3709721565246582},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3684028387069702},{"id":"https://openalex.org/keywords/variable-order-markov-model","display_name":"Variable-order Markov model","score":0.3419036865234375},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23571211099624634},{"id":"https://openalex.org/keywords/binary-entropy-function","display_name":"Binary entropy function","score":0.2286667823791504},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.21273565292358398},{"id":"https://openalex.org/keywords/principle-of-maximum-entropy","display_name":"Principle of maximum entropy","score":0.21068400144577026},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09226414561271667}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.7654072046279907},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.6193183660507202},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5909299850463867},{"id":"https://openalex.org/C125252325","wikidata":"https://www.wikidata.org/wiki/Q1345213","display_name":"Entropy rate","level":4,"score":0.5854824185371399},{"id":"https://openalex.org/C196956702","wikidata":"https://www.wikidata.org/wiki/Q6795829","display_name":"Maximum-entropy Markov model","level":5,"score":0.5074746012687683},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5059639811515808},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.49220648407936096},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48987430334091187},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.45350953936576843},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41512805223464966},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.39763686060905457},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3745373487472534},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3709721565246582},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3684028387069702},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.3419036865234375},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23571211099624634},{"id":"https://openalex.org/C44415725","wikidata":"https://www.wikidata.org/wiki/Q4913893","display_name":"Binary entropy function","level":3,"score":0.2286667823791504},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.21273565292358398},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.21068400144577026},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09226414561271667},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2005.1523737","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523737","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.331.2710","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.2710","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/~tsachy/pdf_files/Approximations for the Entropy Rate of a Hidden Markov Process.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":25,"referenced_works":["https://openalex.org/W53014910","https://openalex.org/W195532570","https://openalex.org/W1976736848","https://openalex.org/W1977109468","https://openalex.org/W1987458394","https://openalex.org/W1990055914","https://openalex.org/W1997136004","https://openalex.org/W2063142364","https://openalex.org/W2087284982","https://openalex.org/W2094123441","https://openalex.org/W2099111195","https://openalex.org/W2110478863","https://openalex.org/W2126785155","https://openalex.org/W2133092578","https://openalex.org/W2147163807","https://openalex.org/W2153623795","https://openalex.org/W2153815969","https://openalex.org/W2171143576","https://openalex.org/W2173680352","https://openalex.org/W2178484049","https://openalex.org/W2485984369","https://openalex.org/W2542539484","https://openalex.org/W2561775628","https://openalex.org/W2567540888","https://openalex.org/W2798909945"],"related_works":["https://openalex.org/W1840407238","https://openalex.org/W2382132287","https://openalex.org/W2133092578","https://openalex.org/W1615861041","https://openalex.org/W2043591730","https://openalex.org/W2130519334","https://openalex.org/W2259410374","https://openalex.org/W2159877461","https://openalex.org/W2534591499","https://openalex.org/W4211010039"],"abstract_inverted_index":{"Let":[0],"{X":[1],"<sub":[2,14,40],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[3,15,41],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">t</sub>":[4,16,42],"}":[5,17,43],"be":[6],"a":[7,25,50,66,90,114,129],"stationary":[8],"finite-alphabet":[9],"Markov":[10,53,69],"chain":[11],"and":[12,47,104],"{Z":[13,39],"denote":[18],"its":[19,57],"noisy":[20],"version":[21],"when":[22],"corrupted":[23],"by":[24,44],"discrete":[26],"memoryless":[27],"channel.":[28],"We":[29],"present":[30],"an":[31],"approach":[32],"to":[33,62,77,113],"bounding":[34],"the":[35,45,63,79,82,93,97,119,123,133],"entropy":[36,83,120],"rate":[37,84],"of":[38,49,65,81,92,132],"construction":[46],"study":[48],"related":[51],"measure-valued":[52],"process.":[54],"To":[55],"illustrate":[56],"efficacy,":[58],"we":[59],"specialize":[60],"it":[61],"case":[64],"BSC-corrupted":[67],"binary":[68],"chain.":[70],"The":[71],"bounds":[72],"obtained":[73],"are":[74],"sufficiently":[75],"tight":[76],"characterize":[78],"behavior":[80],"in":[85],"asymptotic":[86],"regimes":[87],"that":[88],"exhibit":[89],"\"concentration":[91],"support\".":[94],"Examples":[95],"include":[96],"'high":[98],"SNR',":[99,101],"'low":[100],"'rare":[102],"spikes',":[103],"'weak":[105],"dependence'":[106],"regimes.":[107],"Our":[108],"analysis":[109],"also":[110],"gives":[111],"rise":[112],"deterministic":[115],"algorithm":[116],"for":[117,128],"approximating":[118],"rate,":[121],"achieving":[122],"best":[124],"known":[125],"precision-complexity":[126],"tradeoff,":[127],"significant":[130],"subset":[131],"process":[134],"parameter":[135],"space":[136]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}