{"id":"https://openalex.org/W2920861277","doi":"https://doi.org/10.23919/isita.2018.8664267","title":"Dynamic AIFV Coding","display_name":"Dynamic AIFV Coding","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2920861277","doi":"https://doi.org/10.23919/isita.2018.8664267","mag":"2920861277"},"language":"en","primary_location":{"id":"doi:10.23919/isita.2018.8664267","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664267","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","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/A5037856884","display_name":"Hiraoka Tomotaka","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tomotaka HIRAOKA","raw_affiliation_strings":["Nochu Information System Co., Ltd, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Nochu Information System Co., Ltd, Tokyo, Japan","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084723015","display_name":"H. Yamamoto","orcid":"https://orcid.org/0000-0001-6297-8838"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hirosuke YAMAMOTO","raw_affiliation_strings":["Nochu Information System Co., Ltd, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Nochu Information System Co., Ltd, Tokyo, Japan","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037856884"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.18901965,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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.9994000196456909,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9842000007629395,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.96670001745224,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/huffman-coding","display_name":"Huffman coding","score":0.9733355045318604},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.8594229817390442},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.7853769063949585},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.7850460410118103},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.7447370290756226},{"id":"https://openalex.org/keywords/tunstall-coding","display_name":"Tunstall coding","score":0.6539243459701538},{"id":"https://openalex.org/keywords/universal-code","display_name":"Universal code","score":0.6309944987297058},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5898296236991882},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5432627201080322},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.48683494329452515},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4631248414516449},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.4551602900028229},{"id":"https://openalex.org/keywords/polynomial-code","display_name":"Polynomial code","score":0.44209355115890503},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.4143882393836975},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.3717304468154907},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.35875993967056274},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32157713174819946},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31037667393684387},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.22179314494132996},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.17795869708061218},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.12210866808891296},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11430254578590393},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.053476303815841675}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9733355045318604},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.8594229817390442},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.7853769063949585},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.7850460410118103},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.7447370290756226},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.6539243459701538},{"id":"https://openalex.org/C197294415","wikidata":"https://www.wikidata.org/wiki/Q4176366","display_name":"Universal code","level":5,"score":0.6309944987297058},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5898296236991882},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5432627201080322},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.48683494329452515},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4631248414516449},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.4551602900028229},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.44209355115890503},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.4143882393836975},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.3717304468154907},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.35875993967056274},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32157713174819946},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31037667393684387},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.22179314494132996},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.17795869708061218},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.12210866808891296},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11430254578590393},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.053476303815841675},{"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.23919/isita.2018.8664267","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664267","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","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":9,"referenced_works":["https://openalex.org/W2038649859","https://openalex.org/W2085880494","https://openalex.org/W2138026948","https://openalex.org/W2583343534","https://openalex.org/W2792852228","https://openalex.org/W2887855805","https://openalex.org/W2963079252","https://openalex.org/W2963275264","https://openalex.org/W6733229216"],"related_works":["https://openalex.org/W2920861277","https://openalex.org/W1988025666","https://openalex.org/W2975172758","https://openalex.org/W2742651484","https://openalex.org/W2216532275","https://openalex.org/W2792852228","https://openalex.org/W2351464472","https://openalex.org/W4312628177","https://openalex.org/W2114700786","https://openalex.org/W1563389039"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"two":[5,48],"types":[6],"of":[7,98],"dynamic":[8,27,35,67,80,92],"AIFV":[9,28,45,68],"(almost":[10],"instantaneous":[11],"fixed-to-variable":[12],"length)":[13],"coding":[14,69],"schemes":[15],"for":[16],"stationary":[17],"memoryless":[18],"sources":[19],"with":[20,47,61,73],"unknown":[21],"probability":[22,97],"distribution":[23],"such":[24],"that":[25],"the":[26,34,44,52,75,79,91,96,99],"code":[29,37,46,49,60,63,94],"trees":[30,50],"are":[31],"constructed":[32],"from":[33],"Huffman":[36,81,93],"tree.":[38],"The":[39,65],"one":[40],"is":[41,54,104],"based":[42,55],"on":[43,56],"and":[51,83],"other":[53],"a":[57],"simplified":[58],"AIFV-m":[59],"m":[62],"trees.":[64],"proposed":[66],"can":[70,85],"be":[71],"implemented":[72],"almost":[74],"same":[76],"complexity":[77],"as":[78],"coding,":[82],"it":[84],"attain":[86],"better":[87],"compression":[88],"rate":[89],"than":[90,106],"when":[95],"most":[100],"likely":[101],"source":[102],"symbol":[103],"larger":[105],"about":[107],"0.62.":[108]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}