{"id":"https://openalex.org/W2001013592","doi":"https://doi.org/10.1109/isit.2013.6620528","title":"On antidictionary coding based on compacted substring automaton","display_name":"On antidictionary coding based on compacted substring automaton","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2001013592","doi":"https://doi.org/10.1109/isit.2013.6620528","mag":"2001013592"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620528","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620528","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 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/I2799360427","display_name":"Nagano Prefectural Ueda Senior High School","ror":"https://ror.org/0006j5k73","country_code":"JP","type":"education","lineage":["https://openalex.org/I2799360427"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Takahiro Ota","raw_affiliation_strings":["Department of Computer and Systems Engineering, Nagano Prefectural Institute of Technology, Ueda, Nagano, Japan","Dept. of Comput. & Syst. Eng., Nagano Prefectural Inst. of Technol., Nagano, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Systems Engineering, Nagano Prefectural Institute of Technology, Ueda, Nagano, Japan","institution_ids":["https://openalex.org/I2799360427"]},{"raw_affiliation_string":"Dept. of Comput. & Syst. Eng., Nagano Prefectural Inst. of Technol., Nagano, Japan","institution_ids":[]}]},{"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","Grad. Sch. of Inf. Syst., Univ. of Electro-Commun., Chofu, Japan"],"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":"Grad. Sch. of Inf. Syst., Univ. of Electro-Commun., Chofu, Japan","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/I2799360427"],"apc_list":null,"apc_paid":null,"fwci":2.8853,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.91232838,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1754","last_page":"1758"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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.9991999864578247,"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/T12029","display_name":"DNA and Biological Computing","score":0.9984999895095825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.9234546422958374},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6964526772499084},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.5463798642158508},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.5229126214981079},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5182301998138428},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5135552883148193},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5107581615447998},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.49487394094467163},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4899088740348816},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.4801896810531616},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.4776507616043091},{"id":"https://openalex.org/keywords/tunstall-coding","display_name":"Tunstall coding","score":0.4731484651565552},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.44303417205810547},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.389557421207428},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.381816565990448},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3719351589679718},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.36083805561065674},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.27139216661453247},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.18512877821922302},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09377396106719971}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.9234546422958374},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6964526772499084},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.5463798642158508},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.5229126214981079},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5182301998138428},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5135552883148193},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5107581615447998},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.49487394094467163},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4899088740348816},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.4801896810531616},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.4776507616043091},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.4731484651565552},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.44303417205810547},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.389557421207428},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.381816565990448},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3719351589679718},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.36083805561065674},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.27139216661453247},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.18512877821922302},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09377396106719971},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2013.6620528","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620528","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","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":12,"referenced_works":["https://openalex.org/W82544137","https://openalex.org/W1531679840","https://openalex.org/W1966840271","https://openalex.org/W2008421980","https://openalex.org/W2049349451","https://openalex.org/W2052987310","https://openalex.org/W2100854982","https://openalex.org/W2108973077","https://openalex.org/W2120714982","https://openalex.org/W2161565772","https://openalex.org/W3099732688","https://openalex.org/W6677945396"],"related_works":["https://openalex.org/W2408583837","https://openalex.org/W1482505495","https://openalex.org/W186350370","https://openalex.org/W2042728676","https://openalex.org/W2522171317","https://openalex.org/W1990283467","https://openalex.org/W2902125852","https://openalex.org/W2899631209","https://openalex.org/W2404099564","https://openalex.org/W2321527407"],"abstract_inverted_index":{"Lossless":[0],"data":[1],"compression":[2],"via":[3],"substring":[4,23,47,73],"enumeration":[5],"(CSE)":[6],"has":[7],"been":[8],"proposed":[9,86],"by":[10],"Dub\u00e9":[11],"and":[12,28,49],"Beaudoin":[13],"in":[14],"2010.":[15],"The":[16],"CSE":[17],"outputs":[18],"its":[19],"encoder":[20,55],"called":[21],"compacted":[22,46,72],"automaton":[24,34,48,74],"as":[25],"a":[26,62,89],"codeword,":[27],"an":[29,43,54,81],"efficient":[30],"representation":[31,70],"of":[32,56,71,76,84],"the":[33,69,85],"is":[35,53],"also":[36],"proposed.":[37],"In":[38],"this":[39],"paper,":[40],"we":[41,60,79],"prove":[42,80],"isomorphism":[44],"between":[45],"antidictionary":[50,57,65],"automaton,":[51],"which":[52,67],"coding.":[58],"Then":[59],"propose":[61],"new":[63],"static":[64],"coding":[66,87],"uses":[68],"instead":[75],"antidictionary.":[77],"Moreover,":[78],"asymptotic":[82],"optimality":[83],"for":[88],"stationary":[90],"ergodic":[91],"source.":[92]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}