{"id":"https://openalex.org/W2069074906","doi":"https://doi.org/10.1109/tit.1983.1056652","title":"Minimax noiseless universal coding for Markov sources","display_name":"Minimax noiseless universal coding for Markov sources","publication_year":1983,"publication_date":"1983-03-01","ids":{"openalex":"https://openalex.org/W2069074906","doi":"https://doi.org/10.1109/tit.1983.1056652","mag":"2069074906"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1983.1056652","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056652","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,"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"},"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/A5068322739","display_name":"L. Davisson","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"L. Davisson","raw_affiliation_strings":["Electrical Engineering Department, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068322739"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":2.3256,"has_fulltext":false,"cited_by_count":64,"citation_normalized_percentile":{"value":0.90153953,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"29","issue":"2","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.9994000196456909,"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.9994000196456909,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8489124774932861},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.7198848724365234},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6846615076065063},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.6626436114311218},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5371120572090149},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5322667956352234},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.48311305046081543},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47363677620887756},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24847400188446045},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2446715235710144},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1324652135372162}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8489124774932861},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.7198848724365234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6846615076065063},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6626436114311218},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5371120572090149},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5322667956352234},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.48311305046081543},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47363677620887756},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24847400188446045},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2446715235710144},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1324652135372162},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1983.1056652","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056652","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,"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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1999120268","https://openalex.org/W2055094761","https://openalex.org/W2059304230","https://openalex.org/W2131024393","https://openalex.org/W2183235533"],"related_works":["https://openalex.org/W2016058626","https://openalex.org/W2474724840","https://openalex.org/W2895916002","https://openalex.org/W1530911128","https://openalex.org/W1814049089","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W2367222340"],"abstract_inverted_index":{"Upper":[0],"and":[1,23,35],"lower":[2,36,54],"bounds":[3,37],"are":[4,26,38],"presented":[5],"on":[6,61,69],"the":[7,33,62,70,79],"minimax":[8],"redundancy":[9,64],"for":[10,65],"Markov":[11,24],"source":[12],"noiseless":[13],"block-to-variable":[14],"universal":[15],"coding.":[16],"The":[17,45,53,73],"number":[18],"of":[19,81],"states,":[20],"block":[21],"size,":[22],"order":[25],"arbitrary":[27,67],"but":[28],"finite.":[29],"Unlike":[30],"earlier":[31],"results,":[32],"upper":[34,46],"absolute,":[39],"that":[40],"is,":[41],"not":[42],"merely":[43],"asymptotic.":[44],"bound":[47,55,60,74],"is":[48,56],"established":[49,57],"by":[50,58],"combinatorial":[51],"bounds.":[52],"a":[59],"average":[63],"an":[66],"distribution":[68],"transition":[71],"probabilities.":[72],"can":[75],"be":[76],"optimized":[77],"across":[78],"choice":[80],"distribution.":[82]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}