{"id":"https://openalex.org/W1982955456","doi":"https://doi.org/10.1109/tit.2004.830765","title":"Markov Types and Minimax Redundancy for Markov Sources","display_name":"Markov Types and Minimax Redundancy for Markov Sources","alternate_titles":[],"publication_year":2004,"publication_date":"2004-06-21","ids":{"openalex":"https://openalex.org/W1982955456","doi":"https://doi.org/10.1109/tit.2004.830765","mag":"1982955456"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2004.830765","doi":"https://doi.org/10.1109/tit.2004.830765","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2004.830765","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W1982955456"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5003701879","display_name":"Philippe Jacquet","orcid":"https://orcid.org/0000-0001-7919-1206","observed_orcids":["https://orcid.org/0000-0001-7919-1206","https://orcid.org/0000-0003-2366-9818"]},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"P. Jacquet","raw_affiliation_strings":["INRIA, Le Chesnay, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA, Le Chesnay, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019536160","display_name":"Wojciech Szpankowski","orcid":"https://orcid.org/0000-0001-9062-0067","observed_orcids":["https://orcid.org/0000-0001-9062-0067"]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"W. Szpankowski","raw_affiliation_strings":["Department of Computer Science, Purdue University, West Lafayette, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":3.6146,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.92773438,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":"50","issue":"7","first_page":"1393","last_page":"1402"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.00019999999494757503,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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-sources","display_name":"Markov sources","score":0.9169999957084656},{"id":"https://openalex.org/keywords/universal-source-coding","display_name":"universal source coding","score":0.7179999947547913},{"id":"https://openalex.org/keywords/asymptotic-analysis","display_name":"asymptotic analysis","score":0.6679999828338623},{"id":"https://openalex.org/keywords/catalan-numbers","display_name":"Catalan numbers","score":0.3100000023841858}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.7423332333564758},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6962207555770874},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6806423664093018},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6238250136375427},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5489509701728821},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5149624943733215},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.44464460015296936},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.4260317087173462},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21133765578269958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19807416200637817},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1259349286556244},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tit.2004.830765","doi":"https://doi.org/10.1109/tit.2004.830765","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2004.830765","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"mag:2184635959","doi":null,"is_oa":false,"landing_page_url":"http://ieeexplore.ieee.org/iel5/18/29003/01306540.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.7.9322","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.9322","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.purdue.edu/homes/spa/papers/red-markov.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.78.6974","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.6974","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.purdue.edu/homes/spa/papers/red-f-markov.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W18458893","https://openalex.org/W1551177513","https://openalex.org/W1597723816","https://openalex.org/W1999120268","https://openalex.org/W2012867143","https://openalex.org/W2018919817","https://openalex.org/W2068728923","https://openalex.org/W2068782468","https://openalex.org/W2069074906","https://openalex.org/W2087686387","https://openalex.org/W2099111195","https://openalex.org/W2102098892","https://openalex.org/W2109635309","https://openalex.org/W2110084720","https://openalex.org/W2114874848","https://openalex.org/W2122056749","https://openalex.org/W2130956967","https://openalex.org/W2131024393","https://openalex.org/W2148381206","https://openalex.org/W2162486070","https://openalex.org/W2162761290","https://openalex.org/W2164760593","https://openalex.org/W2183235533","https://openalex.org/W2904772602","https://openalex.org/W2914659449","https://openalex.org/W4285719527","https://openalex.org/W4300614234"],"related_works":["https://openalex.org/W35438320","https://openalex.org/W2069074906","https://openalex.org/W2110084720","https://openalex.org/W2117959102","https://openalex.org/W2106640189","https://openalex.org/W2162761290","https://openalex.org/W3194582986","https://openalex.org/W2800605002","https://openalex.org/W2098345316"],"abstract_inverted_index":{"Redundancy":[0],"of":[1,7,58,65,78,97,105,127,155,161,168,194,196,202,212,214],"universal":[2,59],"codes":[3,61],"for":[4,31,62,75,120,191],"a":[5,98,121,159,181,197],"class":[6],"sources":[8,64,77],"determines":[9],"by":[10,173,207],"how":[11],"much":[12],"the":[13,18,23,28,32,36,53,71,95,103,106,130,140,148,192],"actual":[14],"code":[15,20,30],"length":[16,96],"exceeds":[17],"optimal":[19],"length.":[21],"In":[22,183],"minimax":[24,39,46,56,73],"scenario,":[25],"one":[26],"designs":[27],"best":[29],"worst":[33,48,54],"source":[34,99],"within":[35],"class.":[37],"Such":[38],"redundancy":[40,57,74,149],"comes":[41],"in":[42,180],"two":[43],"flavors:":[44],"average":[45],"or":[47],"case":[49,55],"minimax.":[50],"We":[51,68],"study":[52],"block":[60],"Markovian":[63],"any":[66],"order.":[67],"prove":[69],"that":[70,119],"maximal":[72],"Markov":[76,126,164,169,199],"order":[79,128],"r":[80],"is":[81,94,102,112,139,171],"asymptotically":[82],"equal":[83],"to":[84,176],"1/2m/sup":[85],"r/(m-1)log/sub":[86],"2/n+log/sub":[87],"2/A/sub":[88],"m//sup":[89,110],"r/-(lnlnm/sup":[90],"1/(m-1)/)/lnm+o(1),":[91],"where":[92,137],"n":[93],"sequence,":[100],"m":[101],"size":[104],"alphabet,":[107],"and":[108,125,188,209],"A/sub":[109,132],"r/":[111],"an":[113,152],"explicit":[114],"constant":[115,131],"(e.g.,":[116],"we":[117,146,185],"find":[118],"binary":[122],"alphabet":[123],"m=2":[124],"r=1":[129],"2//sup":[133],"1/=16/spl":[134],"middot/G/spl":[135],"ap/14.655449504":[136],"G":[138],"Catalan":[141],"number).":[142],"Unlike":[143],"previous":[144],"attempts,":[145],"view":[147],"problem":[150],"as":[151],"asymptotic":[153,189],"evaluation":[154],"certain":[156],"sums":[157],"over":[158],"set":[160],"matrices":[162],"representing":[163],"types.":[165],"The":[166],"enumeration":[167],"types":[170],"accomplished":[172],"reducing":[174],"it":[175],"counting":[177],"Eulerian":[178],"paths":[179],"multigraph.":[182],"particular,":[184],"propose":[186],"exact":[187],"formulas":[190],"number":[193],"strings":[195],"given":[198],"type.":[200],"All":[201],"these":[203],"findings":[204],"are":[205],"obtained":[206],"analytic":[208],"combinatorial":[210],"tools":[211],"analysis":[213],"algorithms.":[215]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1982955456","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
