{"id":"https://openalex.org/W1560620696","doi":"https://doi.org/10.1109/isit.2004.1365094","title":"Linear time universal coding of tree sources via FSM closure","display_name":"Linear time universal coding of tree sources via FSM closure","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W1560620696","doi":"https://doi.org/10.1109/isit.2004.1365094","mag":"1560620696"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365094","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5033879041","display_name":"\u00c1lvaro Mart\u00edn","orcid":"https://orcid.org/0000-0001-8601-1242"},"institutions":[{"id":"https://openalex.org/I180910786","display_name":"Universidad de la Rep\u00fablica de Uruguay","ror":"https://ror.org/030bbe882","country_code":"UY","type":"education","lineage":["https://openalex.org/I180910786"]}],"countries":["UY"],"is_corresponding":false,"raw_author_name":"A. Martin","raw_affiliation_strings":["Instituto de Computaci\u00f3n, Universidad de la Rep\u00fablica, Montevideo, Uruguay"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto de Computaci\u00f3n, Universidad de la Rep\u00fablica, Montevideo, Uruguay","institution_ids":["https://openalex.org/I180910786"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029865536","display_name":"G. Seroussi","orcid":"https://orcid.org/0000-0002-2893-189X"},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. Seroussi","raw_affiliation_strings":["Hewlett Packard Laboratories, Palo Alto, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hewlett Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041025739","display_name":"M.J. Weinberger","orcid":null},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.J. Weinberger","raw_affiliation_strings":["Hewlett Packard Laboratories, Palo Alto, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hewlett Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07862692,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"20","issue":null,"first_page":"57","last_page":"57"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9988999962806702,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9987999796867371,"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/decoding-methods","display_name":"Decoding methods","score":0.7035174369812012},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6919034719467163},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.6467983722686768},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6133441925048828},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.56996089220047},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5624938011169434},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5577893257141113},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5377609133720398},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.481960266828537},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.47432655096054077},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4723207652568817},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.47092193365097046},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4562084376811981},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4411660432815552},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4323587417602539},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2602594494819641},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23817431926727295},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1358889639377594},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09437835216522217},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07253065705299377}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7035174369812012},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6919034719467163},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.6467983722686768},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6133441925048828},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.56996089220047},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5624938011169434},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5577893257141113},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5377609133720398},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.481960266828537},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.47432655096054077},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4723207652568817},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.47092193365097046},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4562084376811981},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4411660432815552},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4323587417602539},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2602594494819641},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23817431926727295},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1358889639377594},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09437835216522217},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07253065705299377},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2004.1365094","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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":4,"referenced_works":["https://openalex.org/W1999120268","https://openalex.org/W2082967074","https://openalex.org/W2095963120","https://openalex.org/W2183235533"],"related_works":["https://openalex.org/W2508541108","https://openalex.org/W4242459863","https://openalex.org/W127357700","https://openalex.org/W1480528870","https://openalex.org/W4243191745","https://openalex.org/W2724597727","https://openalex.org/W2315419748","https://openalex.org/W1582302366","https://openalex.org/W4312340169","https://openalex.org/W1029445510"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"the":[3,53],"first":[4],"algorithm":[5],"for":[6],"linear":[7],"time":[8],"encoding/decoding":[9],"of":[10,16,27,46],"a":[11,23,47],"twice-universal":[12],"code":[13,21],"in":[14,33],"class":[15],"tree":[17],"models.":[18],"The":[19,29,43],"implemented":[20],"is":[22,40,57],"two-pass":[24],"(semi-predictive)":[25],"version":[26],"context.":[28],"algorithmic":[30],"tools":[31],"employed":[32],"its":[34],"derivation":[35],"and":[36],"their":[37],"information-theoretic":[38],"implications":[39],"also":[41],"investigated.":[42],"FSM":[44],"closure":[45],"generalised":[48],"context":[49],"tree,":[50],"defined":[51],"as":[52],"smallest":[54],"finite-state":[55],"machine":[56],"characterised.":[58]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}