{"id":"https://openalex.org/W2129623613","doi":"https://doi.org/10.1109/isit.2013.6620559","title":"Redundancy analysis in lossless compression of a binary tree via its minimal DAG representation","display_name":"Redundancy analysis in lossless compression of a binary tree via its minimal DAG representation","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2129623613","doi":"https://doi.org/10.1109/isit.2013.6620559","mag":"2129623613"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620559","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 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/A5100436760","display_name":"Jie Zhang","orcid":"https://orcid.org/0000-0002-5348-7671"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jie Zhang","raw_affiliation_strings":["Avoca Technologies, Inc., Ontario, CA, USA","Avoca Technol. Inc., Richmond Hill, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Avoca Technologies, Inc., Ontario, CA, USA","institution_ids":[]},{"raw_affiliation_string":"Avoca Technol. Inc., Richmond Hill, ON, Canada","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080794633","display_name":"En\u2010hui Yang","orcid":"https://orcid.org/0000-0003-1504-7584"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"En-hui Yang","raw_affiliation_strings":["ECE Department, University of Waterloo, Waterloo, ONT, Canada","ECE Department, University of Waterloo, Waterloo, ON, Canada"],"affiliations":[{"raw_affiliation_string":"ECE Department, University of Waterloo, Waterloo, ONT, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"ECE Department, University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"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/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]},{"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":"John C. Kieffer","raw_affiliation_strings":["ECE Department, University of Minnesota, Twin Cities, Minneapolis, MN, USA","[ECE Department, University of Minnesota, Twin Cities, Minneapolis, MN, USA]"],"affiliations":[{"raw_affiliation_string":"ECE Department, University of Minnesota, Twin Cities, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I4210101327","https://openalex.org/I130238516"]},{"raw_affiliation_string":"[ECE Department, University of Minnesota, Twin Cities, Minneapolis, MN, USA]","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100436760"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4809,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.77093577,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2987","issue":null,"first_page":"1914","last_page":"1918"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.6620734930038452},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.5474498867988586},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5367793440818787},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.49407270550727844},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.49232208728790283},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48294228315353394},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.478484570980072},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.4451078772544861},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38767313957214355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2934209108352661},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2849833369255066},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.2095017433166504},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1919502317905426},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09539395570755005}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6620734930038452},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.5474498867988586},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5367793440818787},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.49407270550727844},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.49232208728790283},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48294228315353394},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.478484570980072},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.4451078772544861},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38767313957214355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2934209108352661},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2849833369255066},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.2095017433166504},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1919502317905426},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09539395570755005},{"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.2013.6620559","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W147871093","https://openalex.org/W1549664537","https://openalex.org/W1551177513","https://openalex.org/W1754942486","https://openalex.org/W2005437133","https://openalex.org/W2034323860","https://openalex.org/W2065060855","https://openalex.org/W2110940943","https://openalex.org/W2130956967","https://openalex.org/W2914659449"],"related_works":["https://openalex.org/W3106969033","https://openalex.org/W2186939576","https://openalex.org/W2357988910","https://openalex.org/W2948148442","https://openalex.org/W2377158164","https://openalex.org/W2187600494","https://openalex.org/W2114030128","https://openalex.org/W2135707701","https://openalex.org/W2095678457","https://openalex.org/W2510680828"],"abstract_inverted_index":{"Let":[0,86],"T":[1,72,118],"denote":[2],"the":[3,23,36,39,46,89,109,144,150,159,167],"set":[4],"of":[5,28,38,41,43,48,134,154,169,172],"all":[6],"structurally":[7],"inequivalent":[8],"finite":[9],"rooted":[10],"ordered":[11],"binary":[12,126,173],"trees.":[13],"For":[14],"each":[15,115],"t":[16,59,83,116],"\u03f5":[17,33,60,84,103,117],"e":[18],"T,":[19],"let":[20,31],"D(t)":[21,44],"be":[22,35,88],"unique":[24],"minimal":[25],"DAG":[26],"representation":[27],"t,":[29],"and":[30,64],"r(t)":[32],"(0,1]":[34],"ratio":[37],"number":[40,47],"vertices":[42],"to":[45,158],"leaves":[49],"oft.":[50],"A":[51],"lossless":[52,68],"prefix":[53],"encoder":[54,69],"\u03c6":[55],"on":[56,71,143,176],"{D(t)":[57],":":[58],"T}":[61],"is":[62,73,106,121,131],"proposed,":[63],"then":[65],"a":[66,125,132,181],"two-step":[67],"\u03c6*":[70,120,155,178],"defined":[74],"by":[75],"\u03c6*(t)":[76],"=":[77,92],"<sup":[78,93],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[79,94,98],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u0394</sup>":[80,95],"\u03c6(D(t))":[81],"for":[82,101,166],"T.":[85],"\u03b3":[87],"function":[90],"\u03b3(x)":[91],"(x/2)log":[96],"<sub":[97],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[99],"(2/x)":[100],"x":[102],"(0,1].":[104],"It":[105],"shown":[107],"that":[108],"normalized":[110,151],"pointwise":[111],"redundancy":[112,153],"in":[113,138],"encoding":[114],"via":[119],"O(\u03b3(r(t))).":[122],"Furthermore,":[123],"given":[124],"tree":[127,174],"source":[128,145,160],"whose":[129],"output":[130],"sequence":[133],"random":[135],"trees":[136],"growing":[137],"size,":[139],"weak":[140],"sufficient":[141],"conditions":[142],"are":[146],"presented":[147],"under":[148],"which":[149,177],"average":[152],"with":[156],"respect":[157],"vanishes":[161],"asymptotically.":[162],"This":[163],"result":[164],"allows":[165],"identification":[168],"some":[170],"families":[171],"sources":[175],"acts":[179],"as":[180],"universal":[182],"code.":[183]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}