{"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":"conference-paper","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":false,"raw_author_name":"Sang-youn Oh","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA"],"raw_orcid":null,"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"],"raw_orcid":null,"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":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":0.8174,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.73711779,"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,89],"\u03b1":[1,25,33,164,170],"be":[2,15,59,105,185],"an":[3,157],"integer":[4],"\u2265":[5],"2.":[6],"We":[7],"define":[8],"a":[9,134,149,178],"finite":[10],"rooted":[11,37],"oriented":[12],"tree":[13],"to":[14,61,80,104],"\u03b1-balanced":[16,68],"if":[17],"(1)":[18],"there":[19],"is":[20,74,128,146,153],"no":[21],"vertex":[22,30,57],"with":[23],">":[24],"children,":[26,34],"(2)":[27],"for":[28],"each":[29,52,55],"having":[31,70],"exactly":[32],"the":[35,65,76,93,106,112,131,154],"subtrees":[36],"at":[38,47],"these":[39,83],"children":[40],"have":[41],"numbers":[42],"of":[43,54,64,67,96,108,111,114,116,133,156,163,181],"leaves":[44],"differing":[45],"by":[46],"most":[48],"1,":[49],"and":[50],"(3)":[51],"child":[53],"internal":[56],"with\u03b1(n)":[58],"logarithm":[60],"base":[62],"two":[63],"number":[66,180],"trees":[69,84],"n":[71],"leaves,":[72],"which":[73,152],"roughly":[75],"codeword":[77],"length":[78],"needed":[79],"losslessly":[81],"compress":[82],"via":[85,188],"fixed-length":[86],"binary":[87],"codewords.":[88],"{{x}}":[90],"J":[91],"denote":[92],"fractional":[94],"part":[95],"x.":[97],"The":[98,125,143],"compression":[99],"rate":[100],"curve":[101],"C\u03b1is":[102,130,148],"defined":[103,140],"set":[107,113],"limit":[109],"points":[110,115,182],"form":[117],"({{log\u03b1n}},":[118],"H\u03b1(n)/n).":[119],"Two":[120],"results":[121],"about":[122],"C\u03b1are":[123],"presented.":[124],"first":[126],"result":[127,145],"that":[129,147],"graph":[132],"unique":[135],"real-valued":[136],"nonconstant":[137],"continuous":[138],"function":[139,159],"on":[141,183],"[0,1].":[142],"second":[144],"2-D":[150,167],"fractal":[151],"attractor":[155],"iterated":[158],"system":[160],"S(\u03b1)":[161],"consisting":[162],"piecewise":[165],"contractive":[166],"mappings.":[168],"For":[169],"=":[171],"2,":[172],"3,":[173],"4,":[174],"we":[175],"illustrate":[176],"how":[177],"large":[179],"C\u03b1can":[184],"rapidly":[186],"generated":[187],"S(\u03b1).":[189]},"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":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}