{"id":"https://openalex.org/W2065060855","doi":"https://doi.org/10.1109/tit.2013.2295392","title":"A Universal Grammar-Based Code for Lossless Compression of Binary Trees","display_name":"A Universal Grammar-Based Code for Lossless Compression of Binary Trees","publication_year":2014,"publication_date":"2014-01-31","ids":{"openalex":"https://openalex.org/W2065060855","doi":"https://doi.org/10.1109/tit.2013.2295392","mag":"2065060855"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2013.2295392","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2295392","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5100436868","display_name":"Jie Zhang","orcid":"https://orcid.org/0000-0003-2493-5209"},"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":true,"raw_author_name":"Jie Zhang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada","[Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"[Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada]","institution_ids":["https://openalex.org/I151746483"]}]},{"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":["Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada","[Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"[Dept. of Electr. & Comput. Eng., Univ. 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/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]},{"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John C. Kieffer","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota Twin Cities, Minneapolis, MN, USA","Dept. of Electr. & Comput. Eng., Univ. of Minnesota Twin Cities, Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota Twin Cities, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I4210101327","https://openalex.org/I130238516"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. 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/A5100436868"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":3.2721,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.92920021,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"60","issue":"3","first_page":"1373","last_page":"1386"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9976000189781189,"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.9961000084877014,"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/code-word","display_name":"Code word","score":0.6760555505752563},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.6520101428031921},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6290525197982788},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6107915639877319},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45767706632614136},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.4447413980960846},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4243190288543701},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.41996386647224426},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.41100630164146423},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36475613713264465},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3589267134666443},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3205944299697876},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.3000567555427551},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.22685888409614563},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1262665092945099}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6760555505752563},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.6520101428031921},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6290525197982788},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6107915639877319},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45767706632614136},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.4447413980960846},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4243190288543701},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41996386647224426},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.41100630164146423},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36475613713264465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3589267134666443},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3205944299697876},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.3000567555427551},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.22685888409614563},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1262665092945099}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2013.2295392","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2295392","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W79265410","https://openalex.org/W147871093","https://openalex.org/W273178449","https://openalex.org/W1496462336","https://openalex.org/W1551177513","https://openalex.org/W1593125407","https://openalex.org/W1770054816","https://openalex.org/W2000346568","https://openalex.org/W2005336926","https://openalex.org/W2005437133","https://openalex.org/W2034323860","https://openalex.org/W2099111195","https://openalex.org/W2110940943","https://openalex.org/W2123014390","https://openalex.org/W2130956967","https://openalex.org/W2131024393","https://openalex.org/W2148506544","https://openalex.org/W2168066076","https://openalex.org/W2905110430","https://openalex.org/W3102335961","https://openalex.org/W4210736171","https://openalex.org/W4249284547","https://openalex.org/W4251984466","https://openalex.org/W4252973173","https://openalex.org/W6637838020"],"related_works":["https://openalex.org/W2107381954","https://openalex.org/W2117536196","https://openalex.org/W2382364329","https://openalex.org/W1510719821","https://openalex.org/W2022598760","https://openalex.org/W3022865202","https://openalex.org/W2375800038","https://openalex.org/W2359010821","https://openalex.org/W3169685561","https://openalex.org/W4244673516"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,11,15,46,49,59,65,68,80,84,92,100],"problem":[3],"of":[4,7,13,17,79,114],"lossless":[5,28],"compression":[6,105],"binary":[8,36,40,75,103,116],"trees,":[9],"with":[10],"aim":[12],"reducing":[14],"number":[16],"code":[18,30,82,106,110],"bits":[19],"needed":[20],"to":[21],"store":[22],"or":[23],"transmit":[24],"such":[25],"trees.":[26],"A":[27],"grammar-based":[29,81,102],"is":[31,51,71,97,107],"presented,":[32],"which":[33,58],"encodes":[34],"each":[35],"tree":[37,50,60,86,104,117],"into":[38,53,73],"a":[39,54,74,108,112],"codeword":[41,89],"in":[42],"two":[43,93],"steps.":[44,95],"In":[45,64],"first":[47],"step,":[48,67],"transformed":[52],"context-free":[55,69],"grammar":[56,70],"from":[57,87],"can":[61],"be":[62],"reconstructed.":[63],"second":[66],"encoded":[72],"codeword.":[76],"The":[77],"decoder":[78],"decodes":[83],"original":[85],"its":[88],"by":[90],"reversing":[91],"encoding":[94],"It":[96],"shown":[98],"that":[99],"resulting":[101],"universal":[109],"on":[111],"family":[113],"probabilistic":[115],"source":[118],"models":[119],"satisfying":[120],"certain":[121],"weak":[122],"restrictions.":[123]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}