{"id":"https://openalex.org/W2963321810","doi":"https://doi.org/10.1109/isit.2018.8437897","title":"Redundancy of Unbounded Memory Markov Classes with Continuity Conditions","display_name":"Redundancy of Unbounded Memory Markov Classes with Continuity Conditions","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2963321810","doi":"https://doi.org/10.1109/isit.2018.8437897","mag":"2963321810"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437897","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","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/A5070167898","display_name":"Changlong Wu","orcid":"https://orcid.org/0000-0001-5255-1275"},"institutions":[{"id":"https://openalex.org/I117965899","display_name":"University of Hawai\u02bbi at M\u0101noa","ror":"https://ror.org/01wspgy28","country_code":"US","type":"education","lineage":["https://openalex.org/I117965899"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Changlong Wu","raw_affiliation_strings":["University of Hawaii at Manoa, Honolulu, HI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hawaii at Manoa, Honolulu, HI, USA","institution_ids":["https://openalex.org/I117965899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007003567","display_name":"Maryam Hosseini","orcid":"https://orcid.org/0000-0001-8223-6698"},"institutions":[{"id":"https://openalex.org/I117965899","display_name":"University of Hawai\u02bbi at M\u0101noa","ror":"https://ror.org/01wspgy28","country_code":"US","type":"education","lineage":["https://openalex.org/I117965899"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maryam Hosseini","raw_affiliation_strings":["University of Hawaii at Manoa, Honolulu, HI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hawaii at Manoa, Honolulu, HI, USA","institution_ids":["https://openalex.org/I117965899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030506196","display_name":"Narayana Santhanam","orcid":"https://orcid.org/0000-0001-6515-6311"},"institutions":[{"id":"https://openalex.org/I117965899","display_name":"University of Hawai\u02bbi at M\u0101noa","ror":"https://ror.org/01wspgy28","country_code":"US","type":"education","lineage":["https://openalex.org/I117965899"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Narayana Santhanam","raw_affiliation_strings":["University of Hawaii at Manoa, Honolulu, HI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hawaii at Manoa, Honolulu, HI, USA","institution_ids":["https://openalex.org/I117965899"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.169,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64614875,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"211","last_page":"215"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T12029","display_name":"DNA and Biological Computing","score":0.9965000152587891,"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/T12162","display_name":"Cellular Automata and Applications","score":0.989300012588501,"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/redundancy","display_name":"Redundancy (engineering)","score":0.6637374758720398},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6130582690238953},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5087037682533264},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.473073810338974},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4554455280303955},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44361501932144165},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39302846789360046},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36359724402427673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33758240938186646},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.17355147004127502},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.15875107049942017},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07118010520935059}],"concepts":[{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6637374758720398},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6130582690238953},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5087037682533264},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.473073810338974},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4554455280303955},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44361501932144165},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39302846789360046},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36359724402427673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33758240938186646},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.17355147004127502},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.15875107049942017},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07118010520935059},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2018.8437897","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W18458893","https://openalex.org/W1982955456","https://openalex.org/W1999120268","https://openalex.org/W2055309977","https://openalex.org/W2068782468","https://openalex.org/W2069074906","https://openalex.org/W2082967074","https://openalex.org/W2103396489","https://openalex.org/W2114874848","https://openalex.org/W2129902114","https://openalex.org/W2131024393","https://openalex.org/W2154064234","https://openalex.org/W2162486070","https://openalex.org/W2162761290","https://openalex.org/W2163294786","https://openalex.org/W2508966560","https://openalex.org/W2745253962","https://openalex.org/W2963321810","https://openalex.org/W2963577772","https://openalex.org/W4285719527","https://openalex.org/W4293404332","https://openalex.org/W6600730831","https://openalex.org/W6676718341","https://openalex.org/W6683597717"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1495042958","https://openalex.org/W2494338568","https://openalex.org/W1660242800","https://openalex.org/W2122678784","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W2367222340"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,25,30,37,53,61,81,116,119,126,129],"redundancy":[3,133],"of":[4,44,55],"universally":[5],"compressing":[6],"strings":[7],"X":[8],"<sub":[9,67,71,85,89],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[10,68,72,75,86,90,93],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sub>":[11],",":[12],"...,Xn":[13],"generated":[14],"by":[15,48],"a":[16,42,49,132],"binary":[17],"Markov":[18,38,45],"source":[19],"p":[20],"without":[21],"any":[22],"bound":[23,58],"on":[24,59,115],"memory.":[26],"To":[27],"better":[28],"understand":[29],"connection":[31],"between":[32],"compression":[33],"and":[34,112],"estimation":[35],"in":[36,125],"regime,":[39],"we":[40,107,121],"consider":[41],"class":[43,127],"sources":[46,124],"restricted":[47],"continuity":[50,62],"condition.":[51],"In":[52,118],"absence":[54],"an":[56],"upper":[57,111],"memory,":[60],"condition":[63],"implies":[64],"that":[65],"p(X":[66,84],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">0</sub>":[69,87],"|X":[70,88],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-m</sub>":[73],"<sup":[74,92],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-1</sup>":[76,94],")":[77,95],"gets":[78],"closer":[79],"to":[80],"true":[82],"probability":[83],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-\u221e</sub>":[91],"as":[96],"m":[97],"increases,":[98],"rather":[99],"than":[100],"vary":[101],"around":[102],"arbitrarily.":[103],"For":[104],"such":[105],"sources,":[106],"prove":[108],"asymptotically":[109],"matching":[110],"lower":[113],"bounds":[114],"redundancy.":[117],"process,":[120],"identify":[122],"what":[123],"matter":[128],"most":[130],"from":[131],"perspective.":[134]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}