{"id":"https://openalex.org/W2075320722","doi":"https://doi.org/10.1109/isit.2007.4557208","title":"On the On-line Arithmetic Coding Based on Antidictionaries with Linear Complexity","display_name":"On the On-line Arithmetic Coding Based on Antidictionaries with Linear Complexity","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2075320722","doi":"https://doi.org/10.1109/isit.2007.4557208","mag":"2075320722"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557208","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 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/A5103233756","display_name":"Takahiro Ota","orcid":"https://orcid.org/0000-0002-8591-0083"},"institutions":[{"id":"https://openalex.org/I172086373","display_name":"Nagano Prefectural College","ror":"https://ror.org/03yp23s77","country_code":"JP","type":"education","lineage":["https://openalex.org/I172086373"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Takahiro Ota","raw_affiliation_strings":["Department of Electronic Engineering, Nagano Prefectural Institute of Technology, Nagano, Japan","Nagano Prefectural Inst. of Technol., Nagano"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, Nagano Prefectural Institute of Technology, Nagano, Japan","institution_ids":[]},{"raw_affiliation_string":"Nagano Prefectural Inst. of Technol., Nagano","institution_ids":["https://openalex.org/I172086373"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102995644","display_name":"Hiroyoshi Morita","orcid":"https://orcid.org/0000-0002-4997-2092"},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroyoshi Morita","raw_affiliation_strings":["Graduate School of Information Systems, University of Electro-Communications, Chofu, Tokyo, Japan","Graduate School of Information Systems, University of Electro-Communications, Chofu Tokyo 182-8585, Japan. Email: morita@is.uec.ac.jp"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Systems, University of Electro-Communications, Chofu, Tokyo, Japan","institution_ids":["https://openalex.org/I20529979"]},{"raw_affiliation_string":"Graduate School of Information Systems, University of Electro-Communications, Chofu Tokyo 182-8585, Japan. Email: morita@is.uec.ac.jp","institution_ids":["https://openalex.org/I20529979"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103233756"],"corresponding_institution_ids":["https://openalex.org/I172086373"],"apc_list":null,"apc_paid":null,"fwci":3.3808,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.92605637,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"105","issue":null,"first_page":"86","last_page":"90"},"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.9948999881744385,"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.9940000176429749,"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/time-complexity","display_name":"Time complexity","score":0.6102474927902222},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5930132865905762},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5908029675483704},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.585114598274231},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5137456655502319},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.510684072971344},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.5069620609283447},{"id":"https://openalex.org/keywords/arithmetic-coding","display_name":"Arithmetic coding","score":0.4958697259426117},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.47842174768447876},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4604938328266144},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.4560953378677368},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4253823757171631},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.42404884099960327},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.33586058020591736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32782822847366333},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2039909064769745},{"id":"https://openalex.org/keywords/context-adaptive-binary-arithmetic-coding","display_name":"Context-adaptive binary arithmetic coding","score":0.18217942118644714},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09929117560386658}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6102474927902222},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5930132865905762},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5908029675483704},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.585114598274231},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5137456655502319},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.510684072971344},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.5069620609283447},{"id":"https://openalex.org/C153338461","wikidata":"https://www.wikidata.org/wiki/Q2651","display_name":"Arithmetic coding","level":4,"score":0.4958697259426117},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.47842174768447876},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4604938328266144},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.4560953378677368},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4253823757171631},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.42404884099960327},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.33586058020591736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32782822847366333},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2039909064769745},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.18217942118644714},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09929117560386658},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2007.4557208","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 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":19,"referenced_works":["https://openalex.org/W201239120","https://openalex.org/W938539187","https://openalex.org/W1521016287","https://openalex.org/W1537803653","https://openalex.org/W2052987310","https://openalex.org/W2059513841","https://openalex.org/W2061983309","https://openalex.org/W2065007831","https://openalex.org/W2107745473","https://openalex.org/W2121517647","https://openalex.org/W2128777897","https://openalex.org/W2161565772","https://openalex.org/W2287693889","https://openalex.org/W2471695108","https://openalex.org/W2888191469","https://openalex.org/W2911940095","https://openalex.org/W2968502902","https://openalex.org/W6608280651","https://openalex.org/W6999615204"],"related_works":["https://openalex.org/W96331545","https://openalex.org/W2073921136","https://openalex.org/W2583658747","https://openalex.org/W2405892617","https://openalex.org/W1548907175","https://openalex.org/W1517600056","https://openalex.org/W3022556214","https://openalex.org/W2160738675","https://openalex.org/W193772702","https://openalex.org/W2003608043"],"abstract_inverted_index":{"This":[0,54],"paper":[1],"proposes":[2],"an":[3,58],"on-line":[4],"data":[5],"compression":[6],"based":[7,51],"on":[8,52],"antidictionaries":[9],"with":[10,37],"linear":[11,36],"time.":[12],"The":[13],"proposed":[14,45],"algorithm":[15,34,46],"works":[16],"using":[17],"only":[18],"suffix":[19],"trees":[20],"without":[21],"constructing":[22],"of":[23,32],"antidictionaries,":[24],"and":[25],"we":[26],"prove":[27],"that":[28],"the":[29,40,44,48],"time":[30],"complexity":[31],"this":[33],"is":[35,67],"respect":[38],"to":[39],"string":[41],"length.":[42],"Furthermore,":[43],"produces":[47],"tree":[49,55],"model":[50,56,61],"antidictionaries.":[53],"gives":[57],"efficient":[59],"probabilistic":[60],"for":[62],"entropy":[63],"codings.":[64],"Its":[65],"effectiveness":[66],"demonstrated":[68],"by":[69],"simulation":[70],"results.":[71]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}