{"id":"https://openalex.org/W2082967074","doi":"https://doi.org/10.1109/tit.1983.1056741","title":"A universal data compression system","display_name":"A universal data compression system","publication_year":1983,"publication_date":"1983-09-01","ids":{"openalex":"https://openalex.org/W2082967074","doi":"https://doi.org/10.1109/tit.1983.1056741","mag":"2082967074"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1983.1056741","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056741","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/A5109212464","display_name":"J. Rissanen","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. Rissanen","raw_affiliation_strings":["IBM Research, San Jose, CA, USA","IBM Research San Jose CA USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Research, San Jose, CA, USA","institution_ids":["https://openalex.org/I1341412227"]},{"raw_affiliation_string":"IBM Research San Jose CA USA","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109212464"],"corresponding_institution_ids":["https://openalex.org/I1341412227"],"apc_list":null,"apc_paid":null,"fwci":4.9172,"has_fulltext":false,"cited_by_count":645,"citation_normalized_percentile":{"value":0.95414563,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"29","issue":"5","first_page":"656","last_page":"664"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9954000115394592,"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"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9954000115394592,"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/data-compression","display_name":"Data compression","score":0.7064131498336792},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6519678831100464},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6452386379241943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5401299595832825},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5255624055862427},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5075360536575317},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.5056028366088867},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.47694388031959534},{"id":"https://openalex.org/keywords/minimum-description-length","display_name":"Minimum description length","score":0.4439274072647095},{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.4408296048641205},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.42043831944465637},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.41630619764328003},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25483518838882446},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18267741799354553},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11433935165405273},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09310469031333923}],"concepts":[{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.7064131498336792},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6519678831100464},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6452386379241943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5401299595832825},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5255624055862427},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5075360536575317},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.5056028366088867},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.47694388031959534},{"id":"https://openalex.org/C87465248","wikidata":"https://www.wikidata.org/wiki/Q1417790","display_name":"Minimum description length","level":2,"score":0.4439274072647095},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.4408296048641205},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.42043831944465637},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.41630619764328003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25483518838882446},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18267741799354553},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11433935165405273},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09310469031333923},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1983.1056741","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056741","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/8","display_name":"Decent work and economic growth","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W133505062","https://openalex.org/W171686316","https://openalex.org/W2016927358","https://openalex.org/W2031366154","https://openalex.org/W2054658115","https://openalex.org/W2061192159","https://openalex.org/W2085093717","https://openalex.org/W2103206811","https://openalex.org/W2119047110","https://openalex.org/W2122962290","https://openalex.org/W2123475648","https://openalex.org/W2796766534"],"related_works":["https://openalex.org/W2948148442","https://openalex.org/W2461250372","https://openalex.org/W2394342941","https://openalex.org/W2169853506","https://openalex.org/W2547124190","https://openalex.org/W1558425494","https://openalex.org/W2350586049","https://openalex.org/W2385628723","https://openalex.org/W2169871401","https://openalex.org/W3008492011"],"abstract_inverted_index":{"A":[0],"universal":[1],"data":[2],"compression":[3],"algorithm":[4,51],"is":[5,8],"described":[6],"which":[7],"capable":[9],"of":[10,30,35,43],"compressing":[11],"long":[12],"strings":[13],"generated":[14],"by":[15],"a":[16,21,41,55],"\"finitely":[17],"generated\"":[18],"source,":[19],"with":[20],"near":[22],"optimum":[23],"per":[24],"symbol":[25],"length":[26],"without":[27],"prior":[28],"knowledge":[29],"the":[31,50,65],"source.":[32],"This":[33],"class":[34],"sources":[36,45],"may":[37],"be":[38],"viewed":[39],"as":[40],"generalization":[42],"Markov":[44],"to":[46,63],"random":[47],"fields.":[48],"Moreover,":[49],"does":[52],"not":[53],"require":[54],"working":[56],"storage":[57],"much":[58],"larger":[59],"than":[60],"that":[61],"needed":[62],"describe":[64],"source":[66],"generating":[67],"parameters.":[68]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":18},{"year":2021,"cited_by_count":21},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":17},{"year":2018,"cited_by_count":21},{"year":2017,"cited_by_count":19},{"year":2016,"cited_by_count":25},{"year":2015,"cited_by_count":29},{"year":2014,"cited_by_count":28},{"year":2013,"cited_by_count":27},{"year":2012,"cited_by_count":31}],"updated_date":"2026-04-26T08:31:28.666265","created_date":"2025-10-10T00:00:00"}