{"id":"https://openalex.org/W1610772244","doi":"https://doi.org/10.1109/isit.2015.7282805","title":"Third-order coding rate for universal compression of Markov sources","display_name":"Third-order coding rate for universal compression of Markov sources","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1610772244","doi":"https://doi.org/10.1109/isit.2015.7282805","mag":"1610772244"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282805","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282805","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 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/A5044733463","display_name":"Nematollah Iri","orcid":"https://orcid.org/0000-0001-9998-1256"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nematollah Iri","raw_affiliation_strings":["School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, 85287, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, 85287, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055511546","display_name":"Oliver Kosut","orcid":"https://orcid.org/0000-0003-4779-0102"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Oliver Kosut","raw_affiliation_strings":["School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, 85287, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, 85287, USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044733463"],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":5.6088,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.95895528,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1996","last_page":"2000"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9966999888420105,"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.9966999888420105,"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.9950000047683716,"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/markov-chain","display_name":"Markov chain","score":0.6853541731834412},{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.6778060793876648},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.5947636365890503},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.565850555896759},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5628995895385742},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5334731936454773},{"id":"https://openalex.org/keywords/aperiodic-graph","display_name":"Aperiodic graph","score":0.5211960673332214},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.5206089019775391},{"id":"https://openalex.org/keywords/universal-code","display_name":"Universal code","score":0.5148941278457642},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.43318983912467957},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.42814958095550537},{"id":"https://openalex.org/keywords/tunstall-coding","display_name":"Tunstall coding","score":0.4232904016971588},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41780632734298706},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40458327531814575},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.39243051409721375},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.3799055516719818},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3486037850379944},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.32451754808425903},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.29532498121261597},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23500877618789673},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11580836772918701},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.1115681529045105}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6853541731834412},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.6778060793876648},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.5947636365890503},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.565850555896759},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5628995895385742},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5334731936454773},{"id":"https://openalex.org/C104247578","wikidata":"https://www.wikidata.org/wiki/Q4779368","display_name":"Aperiodic graph","level":2,"score":0.5211960673332214},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.5206089019775391},{"id":"https://openalex.org/C197294415","wikidata":"https://www.wikidata.org/wiki/Q4176366","display_name":"Universal code","level":5,"score":0.5148941278457642},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.43318983912467957},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.42814958095550537},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.4232904016971588},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41780632734298706},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40458327531814575},{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.39243051409721375},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.3799055516719818},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3486037850379944},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.32451754808425903},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.29532498121261597},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23500877618789673},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11580836772918701},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1115681529045105},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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.2015.7282805","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282805","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4312628177","https://openalex.org/W1579872668","https://openalex.org/W2123072960","https://openalex.org/W2586352442","https://openalex.org/W2156106714","https://openalex.org/W1607635215","https://openalex.org/W2367665007","https://openalex.org/W2344988652","https://openalex.org/W2920861277","https://openalex.org/W2742651484"],"abstract_inverted_index":{"We":[0,49,65],"consider":[1],"the":[2,23,34,37,51,57,71,76,84],"universal":[3,28],"source":[4],"coding":[5,54,73],"problem":[6],"for":[7,15,27,61,75,90],"first-order":[8],"stationary,":[9],"irreducible":[10],"and":[11,82],"aperiodic":[12],"Markov":[13,92],"sources":[14,32],"short":[16],"blocklengths.":[17],"Achievability":[18],"is":[19],"derived":[20],"based":[21,44],"on":[22,45,70],"previously":[24],"introduced":[25],"algorithm":[26],"compression":[29],"of":[30,56,79,86],"memoryless":[31],"in":[33],"finite":[35],"blocklengths,":[36],"Type":[38,58,87],"Size":[39,59,88],"Code,":[40],"which":[41],"encodes":[42],"strings":[43],"type":[46],"class":[47,78],"size.":[48],"derive":[50],"third-order":[52,72],"asymptotic":[53],"rate":[55,74],"code":[60],"this":[62],"model":[63],"class.":[64],"also":[66],"present":[67],"a":[68],"converse":[69],"general":[77],"fixed-to-variable":[80],"codes":[81,89],"show":[83],"optimality":[85],"such":[91],"sources.":[93]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}