{"id":"https://openalex.org/W2168066076","doi":"https://doi.org/10.1109/isit.2010.5513277","title":"Fractal compression rate curves in lossless compression of balanced trees","display_name":"Fractal compression rate curves in lossless compression of balanced trees","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2168066076","doi":"https://doi.org/10.1109/isit.2010.5513277","mag":"2168066076"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513277","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513277","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","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/A5087685145","display_name":"Sang-youn Oh","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sang-youn Oh","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011621116","display_name":"John C. Kieffer","orcid":"https://orcid.org/0000-0002-3108-2323"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. C. Kieffer","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087685145"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":1.3531,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.85370165,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"106","last_page":"110"},"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.9990000128746033,"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/T11567","display_name":"semigroups and automata theory","score":0.9966999888420105,"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/combinatorics","display_name":"Combinatorics","score":0.6017476320266724},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.47589266300201416},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4670730233192444},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44853973388671875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40228137373924255},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40008240938186646},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09328624606132507}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6017476320266724},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47589266300201416},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4670730233192444},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44853973388671875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40228137373924255},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40008240938186646},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09328624606132507},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2010.5513277","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513277","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","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":10,"referenced_works":["https://openalex.org/W1551413707","https://openalex.org/W1976468091","https://openalex.org/W2006522873","https://openalex.org/W2080003810","https://openalex.org/W2110940943","https://openalex.org/W2321308325","https://openalex.org/W2913954881","https://openalex.org/W4238652859","https://openalex.org/W6632686996","https://openalex.org/W6651839628"],"related_works":["https://openalex.org/W2952185452","https://openalex.org/W2980963558","https://openalex.org/W2046736294","https://openalex.org/W1519526186","https://openalex.org/W2980815195","https://openalex.org/W4293584968","https://openalex.org/W2384758770","https://openalex.org/W2032964960","https://openalex.org/W4382701036","https://openalex.org/W3111310291"],"abstract_inverted_index":{"Let":[0,106],"\u03b1":[1,25,33,60,205,211],"be":[2,15,76,126,230],"an":[3,198],"integer":[4],"\u2265":[5,68],"2.":[6],"We":[7],"define":[8],"a":[9,63,171,190,219],"finite":[10],"rooted":[11,37],"oriented":[12],"tree":[13],"to":[14,78,97,125],"\u03b1-balanced":[16,85],"if":[17],"(1)":[18],"there":[19],"is":[20,62,91,123,161,167,183,189,194],"no":[21],"vertex":[22,30,57],"with":[23,58],">":[24],"children,":[26,34],"(2)":[27],"for":[28],"each":[29,52,55,66],"having":[31,87],"exactly":[32],"the":[35,82,93,110,127,133,168,195],"subtrees":[36],"at":[38,47],"these":[39,100],"children":[40,61],"have":[41],"numbers":[42],"of":[43,54,81,84,113,129,132,135,137,170,197,204,222],"leaves":[44],"differing":[45],"by":[46],"most":[48],"1,":[49,69],"and":[50],"(3)":[51],"child":[53],"internal":[56],"<;":[59],"leaf.":[64],"For":[65,210],"n":[67,88],"let":[70],"H":[71,144],"<sub":[72,120,140,145,153,164,186,226],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[73,121,141,146,154,165,187,227],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u03b1</sub>":[74,122,142,147,155,166,188,228],"(n)":[75],"logarithm":[77],"base":[79],"two":[80],"number":[83,221],"trees":[86,101],"leaves,":[89],"which":[90,193],"roughly":[92],"codeword":[94],"length":[95],"needed":[96],"losslessly":[98],"compress":[99],"via":[102,233],"fixed-length":[103],"binary":[104],"codewords.":[105],"{{x}}":[107],"J":[108],"denote":[109],"fractional":[111],"part":[112],"x.":[114],"The":[115,158,180],"compression":[116],"rate":[117],"curve":[118],"C":[119,152,163,185,225],"defined":[124,177],"set":[128,134],"limit":[130],"points":[131,136,223],"form":[138],"({{log":[139],"n}},":[143],"(n)/n).":[148],"Two":[149],"results":[150],"about":[151],"are":[156],"presented.":[157],"first":[159],"result":[160,182],"that":[162,184],"graph":[169],"unique":[172],"real-valued":[173],"nonconstant":[174],"continuous":[175],"function":[176,200],"on":[178,224],"[0,1].":[179],"second":[181],"2-D":[191,208],"fractal":[192],"attractor":[196],"iterated":[199],"system":[201],"S(\u03b1)":[202],"consisting":[203],"piecewise":[206],"contractive":[207],"mappings.":[209],"=":[212],"2,":[213],"3,":[214],"4,":[215],"we":[216],"illustrate":[217],"how":[218],"large":[220],"can":[229],"rapidly":[231],"generated":[232],"S(\u03b1).":[234]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"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"}