{"id":"https://openalex.org/W1966840271","doi":"https://doi.org/10.1109/isit.2010.5513281","title":"Asymptotic optimality of antidictionary codes","display_name":"Asymptotic optimality of antidictionary codes","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W1966840271","doi":"https://doi.org/10.1109/isit.2010.5513281","mag":"1966840271"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513281","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513281","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1006.0284","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Takahiro Ota","orcid":null},"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 Electronic Engineering, Nagano Prefectural Institute of Technology, Ueda, Nagano, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, Nagano Prefectural Institute of Technology, Ueda, Nagano, Japan","institution_ids":["https://openalex.org/I2799360427"]}]},{"author_position":"last","author":{"id":null,"display_name":"Hiroyoshi Morita","orcid":null},"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"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Systems, University of Electro-Communications, Chofu, Tokyo, Japan","institution_ids":["https://openalex.org/I20529979"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2799360427"],"apc_list":null,"apc_paid":null,"fwci":1.4086,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.84041781,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"101","last_page":"105"},"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/T11567","display_name":"semigroups and automata theory","score":0.9986000061035156,"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.9976999759674072,"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/markov-chain","display_name":"Markov chain","score":0.6071000099182129},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.5440999865531921},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.5253999829292297},{"id":"https://openalex.org/keywords/finite-state","display_name":"Finite state","score":0.49559998512268066},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.48899999260902405},{"id":"https://openalex.org/keywords/ergodic-theory","display_name":"Ergodic theory","score":0.4880000054836273},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.48590001463890076},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.48249998688697815},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45410001277923584},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4431000053882599}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7192999720573425},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6071000099182129},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.5440999865531921},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.5253999829292297},{"id":"https://openalex.org/C2983497884","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite state","level":3,"score":0.49559998512268066},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.48899999260902405},{"id":"https://openalex.org/C122044880","wikidata":"https://www.wikidata.org/wiki/Q5498822","display_name":"Ergodic theory","level":2,"score":0.4880000054836273},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.48590001463890076},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.48249998688697815},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45410001277923584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44440001249313354},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4431000053882599},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4221999943256378},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.42160001397132874},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.4187999963760376},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4074000120162964},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3752000033855438},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.36910000443458557},{"id":"https://openalex.org/C196455857","wikidata":"https://www.wikidata.org/wiki/Q5473264","display_name":"Forward algorithm","level":5,"score":0.3490999937057495},{"id":"https://openalex.org/C49555168","wikidata":"https://www.wikidata.org/wiki/Q176583","display_name":"Stochastic matrix","level":3,"score":0.3377000093460083},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.3366999924182892},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C106666656","wikidata":"https://www.wikidata.org/wiki/Q6771323","display_name":"Markov kernel","level":5,"score":0.314300000667572},{"id":"https://openalex.org/C197294415","wikidata":"https://www.wikidata.org/wiki/Q4176366","display_name":"Universal code","level":5,"score":0.3075000047683716},{"id":"https://openalex.org/C189973286","wikidata":"https://www.wikidata.org/wiki/Q176695","display_name":"Markov property","level":4,"score":0.30649998784065247},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.2709999978542328},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.26460000872612},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C2779190172","wikidata":"https://www.wikidata.org/wiki/Q4913888","display_name":"Binary data","level":3,"score":0.2524000108242035},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.25209999084472656}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2010.5513281","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513281","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1006.0284","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1006.0284","pdf_url":"https://arxiv.org/pdf/1006.0284","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1006.0284","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1006.0284","pdf_url":"https://arxiv.org/pdf/1006.0284","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W938539187","https://openalex.org/W1521016287","https://openalex.org/W1537803653","https://openalex.org/W1765295389","https://openalex.org/W2052987310","https://openalex.org/W2059513841","https://openalex.org/W2075320722","https://openalex.org/W2128777897","https://openalex.org/W2158600432","https://openalex.org/W2161565772","https://openalex.org/W2332226395","https://openalex.org/W6634654443","https://openalex.org/W6677945396","https://openalex.org/W6683504902","https://openalex.org/W7007813378","https://openalex.org/W7052102089"],"related_works":[],"abstract_inverted_index":{"An":[0],"antidictionary":[1,10,86],"code":[2,29],"is":[3,12,58],"a":[4,13,49,59,65,91,101],"lossless":[5],"compression":[6],"algorithm":[7],"using":[8],"an":[9,25],"which":[11,64],"set":[14],"of":[15,81],"minimal":[16],"words":[17],"that":[18,57,100],"do":[19],"not":[20],"occur":[21],"as":[22],"substrings":[23],"in":[24,36,63],"input":[26],"string.":[27],"The":[28],"was":[30],"proposed":[31],"by":[32],"Crochemore":[33],"et":[34],"al.":[35],"2000,":[37],"and":[38,84],"its":[39],"asymptotic":[40],"optimality":[41,80],"has":[42],"been":[43],"proved":[44],"with":[45,69,88,105],"respect":[46,89],"to":[47,90],"only":[48],"specific":[50],"information":[51],"source,":[52],"called":[53],"balanced":[54],"binary":[55,60],"source":[56,62,95],"Markov":[61,94],"state":[66,102],"transition":[67,103],"occurs":[68,104],"probability":[70,106],"1/2":[71],"or":[72],"1.":[73],"In":[74],"this":[75],"paper,":[76],"we":[77],"prove":[78],"the":[79],"both":[82],"static":[83],"dynamic":[85],"codes":[87],"stationary":[92],"ergodic":[93],"on":[96],"finite":[97],"alphabet":[98],"such":[99],"p":[107,110],"(0":[108],"<;":[109],"\u2264":[111],"1).":[112]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}