{"id":"https://openalex.org/W2112938612","doi":"https://doi.org/10.1109/allerton.2010.5706981","title":"On the finite-length performance of universal coding for k-ary memoryless sources","display_name":"On the finite-length performance of universal coding for k-ary memoryless sources","publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W2112938612","doi":"https://doi.org/10.1109/allerton.2010.5706981","mag":"2112938612"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2010.5706981","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2010.5706981","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5008645615","display_name":"Ahmad Beirami","orcid":"https://orcid.org/0000-0002-1998-5271"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ahmad Beirami","raw_affiliation_strings":["School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","School of Electrical & Computer Engineering, Georgia Institute of Technology, Atlanta 30332, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"School of Electrical & Computer Engineering, Georgia Institute of Technology, Atlanta 30332, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083854532","display_name":"Faramarz Fekri","orcid":"https://orcid.org/0000-0001-5008-8803"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Faramarz Fekri","raw_affiliation_strings":["School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","School of Electrical & Computer Engineering, Georgia Institute of Technology, Atlanta 30332, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"School of Electrical & Computer Engineering, Georgia Institute of Technology, Atlanta 30332, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008645615"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":2.2552,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.89599652,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"43","issue":null,"first_page":"740","last_page":"744"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9976999759674072,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.69866544008255},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.6968934535980225},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6912047266960144},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5882025361061096},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5592848658561707},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5279922485351562},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4954036474227905},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.49122804403305054},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4445880949497223},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44405806064605713},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.41837549209594727},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35258615016937256},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21324032545089722},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.20225542783737183},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11131501197814941}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.69866544008255},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6968934535980225},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6912047266960144},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5882025361061096},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5592848658561707},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5279922485351562},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4954036474227905},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.49122804403305054},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4445880949497223},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44405806064605713},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.41837549209594727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35258615016937256},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21324032545089722},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.20225542783737183},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11131501197814941},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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":1,"locations":[{"id":"doi:10.1109/allerton.2010.5706981","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2010.5706981","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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":14,"referenced_works":["https://openalex.org/W1995875735","https://openalex.org/W1999120268","https://openalex.org/W2099111195","https://openalex.org/W2101460669","https://openalex.org/W2114874848","https://openalex.org/W2132119275","https://openalex.org/W2148381206","https://openalex.org/W2162209814","https://openalex.org/W2163294786","https://openalex.org/W2169326854","https://openalex.org/W2183235533","https://openalex.org/W2478708596","https://openalex.org/W3123545922","https://openalex.org/W6674851815"],"related_works":["https://openalex.org/W2494338568","https://openalex.org/W1495042958","https://openalex.org/W1983915440","https://openalex.org/W2008268605","https://openalex.org/W3095925971","https://openalex.org/W1557064786","https://openalex.org/W1647069448","https://openalex.org/W2898790172","https://openalex.org/W1941306591","https://openalex.org/W150528880"],"abstract_inverted_index":{"In":[0,92,122],"this":[1,88],"paper,":[2],"we":[3,94,125],"investigate":[4],"the":[5,19,47,57,100,104,131,143,146,150,159,162],"performance":[6],"of":[7,22,103,118,137,145,161],"universal":[8,20],"coding":[9],"schemes":[10],"on":[11,99,130],"finite-length":[12,80],"memoryless":[13,24,53,147],"sequences.":[14],"Rissanen":[15],"demonstrated":[16],"that":[17,106,141],"for":[18,28,39,51,133],"compression":[21],"k-ary":[23,52],"sources,":[25,54],"expected":[26,49],"redundancy":[27,50,59,112,132,151],"regular":[29],"codes":[30],"is":[31,78,90],"asymptotically":[32],"lower":[33,97,128],"bounded":[34],"by":[35],"(k-1)/2":[36,119],"log":[37,120],"n":[38],"almost":[40],"all":[41,61],"sources.":[42,138],"Xie":[43],"and":[44,156],"Barron":[45],"derived":[46],"minimax":[48],"which":[55],"characterizes":[56],"maximum":[58],"over":[60],"possible":[62],"source":[63,73],"parameters.":[64],"It":[65],"does":[66],"not":[67,108],"provide":[68],"much":[69],"information":[70],"about":[71],"different":[72],"parameter":[74],"values.":[75],"This":[76],"paper":[77,89],"a":[79,96,111,115,127,134],"extension":[81],"to":[82,153,158],"Rissanen's":[83],"result.":[84],"Our":[85],"treatment":[86],"in":[87],"probabilistic.":[91],"particular,":[93],"derive":[95],"bound":[98,129],"probability":[101],"measure":[102],"sources":[105],"are":[107],"compressible":[109],"with":[110],"smaller":[113],"than":[114],"certain":[116],"fraction":[117],"n.":[121],"other":[123],"words,":[124],"demonstrate":[126,140],"given":[135],"percentile":[136],"We":[139],"as":[142],"length":[144],"sequence":[148],"decreases,":[149],"tends":[152],"become":[154],"significant":[155],"comparable":[157],"entropy":[160],"sequence.":[163]},"counts_by_year":[{"year":2017,"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"}