{"id":"https://openalex.org/W2946850464","doi":"https://doi.org/10.1109/tit.2019.2919829","title":"Universal Tree Source Coding Using Grammar-Based Compression","display_name":"Universal Tree Source Coding Using Grammar-Based Compression","publication_year":2019,"publication_date":"2019-05-29","ids":{"openalex":"https://openalex.org/W2946850464","doi":"https://doi.org/10.1109/tit.2019.2919829","mag":"2946850464"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2019.2919829","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2019.2919829","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/A5005654849","display_name":"Moses Ganardi","orcid":"https://orcid.org/0000-0002-0775-7781"},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Moses Ganardi","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Siegen, Siegen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Siegen, Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032713735","display_name":"Danny Hucke","orcid":null},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Danny Hucke","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Siegen, Siegen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Siegen, Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005500210","display_name":"Markus Lohrey","orcid":"https://orcid.org/0000-0002-4680-7198"},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Lohrey","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Siegen, Siegen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Siegen, Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019630084","display_name":"Louisa Seelbach Benkner","orcid":"https://orcid.org/0000-0002-3204-3801"},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Louisa Seelbach Benkner","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Siegen, Siegen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Siegen, Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5005654849"],"corresponding_institution_ids":["https://openalex.org/I206895457"],"apc_list":null,"apc_paid":null,"fwci":0.9801,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.81872459,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"65","issue":"10","first_page":"6399","last_page":"6413"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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.9997000098228455,"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.9994999766349792,"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/binary-tree","display_name":"Binary tree","score":0.622056245803833},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5986573100090027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.534662127494812},{"id":"https://openalex.org/keywords/binary-expression-tree","display_name":"Binary expression tree","score":0.5329678058624268},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5217645764350891},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.5210011601448059},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.504402756690979},{"id":"https://openalex.org/keywords/pointwise","display_name":"Pointwise","score":0.47456008195877075},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4458846151828766},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44119706749916077},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4402998089790344},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.41740113496780396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41296496987342834},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3417399525642395},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2903605103492737},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.14990383386611938}],"concepts":[{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.622056245803833},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5986573100090027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.534662127494812},{"id":"https://openalex.org/C166055160","wikidata":"https://www.wikidata.org/wiki/Q4913895","display_name":"Binary expression tree","level":3,"score":0.5329678058624268},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5217645764350891},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.5210011601448059},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.504402756690979},{"id":"https://openalex.org/C2777984123","wikidata":"https://www.wikidata.org/wiki/Q9248237","display_name":"Pointwise","level":2,"score":0.47456008195877075},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4458846151828766},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44119706749916077},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4402998089790344},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.41740113496780396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41296496987342834},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3417399525642395},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2903605103492737},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.14990383386611938},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2019.2919829","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2019.2919829","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":[],"awards":[{"id":"https://openalex.org/G4107178202","display_name":null,"funder_award_id":"748/10-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W186403072","https://openalex.org/W1587603465","https://openalex.org/W1754942486","https://openalex.org/W2005336926","https://openalex.org/W2005437133","https://openalex.org/W2022891963","https://openalex.org/W2034323860","https://openalex.org/W2041211107","https://openalex.org/W2052653988","https://openalex.org/W2065060855","https://openalex.org/W2065095710","https://openalex.org/W2095963120","https://openalex.org/W2110940943","https://openalex.org/W2122962290","https://openalex.org/W2127892269","https://openalex.org/W2130433404","https://openalex.org/W2130956967","https://openalex.org/W2139346255","https://openalex.org/W2171818384","https://openalex.org/W2293244104","https://openalex.org/W2321308325","https://openalex.org/W2478708596","https://openalex.org/W2510793939","https://openalex.org/W2514864374","https://openalex.org/W2962878694","https://openalex.org/W2963295241","https://openalex.org/W4245857357","https://openalex.org/W4289784571"],"related_works":["https://openalex.org/W2951678044","https://openalex.org/W4300450359","https://openalex.org/W2113320216","https://openalex.org/W3091576183","https://openalex.org/W2371680642","https://openalex.org/W4319999454","https://openalex.org/W4309419985","https://openalex.org/W2391990459","https://openalex.org/W2963064892","https://openalex.org/W2798865732"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,22,44,65,86,96,119],"universal":[3,114],"source":[4],"coding":[5],"for":[6,31,58,105,116],"binary":[7,32,45,107,120],"trees":[8],"is":[9,48,72],"considered.":[10],"Zhang,":[11,66],"Yang,":[12,67],"and":[13,68],"Kieffer":[14],"derived":[15],"upper":[16,98],"bounds":[17,76,99],"on":[18,25,77,100],"the":[19,52,63,78,87,101],"average-case":[20,88],"redundancy":[21,81,104],"codes":[23,115],"based":[24],"directed":[26],"acyclic":[27],"graph":[28],"(DAG)":[29],"compression":[30],"tree":[33,46,93,108,121],"sources":[34,47,109],"with":[35],"certain":[36,106],"properties.":[37],"In":[38],"this":[39],"paper,":[40],"a":[41],"natural":[42],"class":[43],"presented":[49],"such":[50],"that":[51],"demanded":[53],"properties":[54],"are":[55,110],"fulfilled.":[56],"Moreover,":[57],"both":[59],"subclasses":[60],"considered":[61],"in":[62],"paper":[64],"Kieffer,":[69],"their":[70],"result":[71],"improved":[73],"by":[74],"deriving":[75],"maximal":[79,102],"pointwise":[80,103],"(or":[82],"worst-case":[83],"redundancy)":[84],"instead":[85,95],"redundancy.":[89],"Finally,":[90],"using":[91],"context-free":[92],"grammars":[94],"DAGs,":[97],"derived.":[111],"This":[112],"yields":[113],"new":[117],"classes":[118],"sources.":[122]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}