{"id":"https://openalex.org/W2975172758","doi":"https://doi.org/10.1109/isit.2019.8849775","title":"Enumeration and Coding of Compact Code Trees for Binary AIFV Codes","display_name":"Enumeration and Coding of Compact Code Trees for Binary AIFV Codes","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2975172758","doi":"https://doi.org/10.1109/isit.2019.8849775","mag":"2975172758"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849775","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849775","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","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/A5080033205","display_name":"Kengo Hashimoto","orcid":"https://orcid.org/0000-0001-5836-0023"},"institutions":[{"id":"https://openalex.org/I111966504","display_name":"University of Fukui","ror":"https://ror.org/00msqp585","country_code":"JP","type":"education","lineage":["https://openalex.org/I111966504"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Kengo Hashimoto","raw_affiliation_strings":["University of Fukui"],"affiliations":[{"raw_affiliation_string":"University of Fukui","institution_ids":["https://openalex.org/I111966504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013763523","display_name":"Ken\u2010ichi Iwata","orcid":"https://orcid.org/0000-0002-8838-375X"},"institutions":[{"id":"https://openalex.org/I111966504","display_name":"University of Fukui","ror":"https://ror.org/00msqp585","country_code":"JP","type":"education","lineage":["https://openalex.org/I111966504"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ken-ichi Iwata","raw_affiliation_strings":["University of Fukui"],"affiliations":[{"raw_affiliation_string":"University of Fukui","institution_ids":["https://openalex.org/I111966504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084723015","display_name":"H. Yamamoto","orcid":"https://orcid.org/0000-0001-6297-8838"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hirosuke Yamamoto","raw_affiliation_strings":["The University of Tokyo","The University of Tokyo,"],"affiliations":[{"raw_affiliation_string":"The University of Tokyo","institution_ids":["https://openalex.org/I74801974"]},{"raw_affiliation_string":"The University of Tokyo,","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080033205"],"corresponding_institution_ids":["https://openalex.org/I111966504"],"apc_list":null,"apc_paid":null,"fwci":0.2891,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.67057187,"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":"1527","last_page":"1531"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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.9646999835968018,"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/T11130","display_name":"Coding theory and cryptography","score":0.9550999999046326,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.8531002998352051},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.7890176773071289},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.7514232397079468},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.7306755185127258},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.7085370421409607},{"id":"https://openalex.org/keywords/constant-weight-code","display_name":"Constant-weight code","score":0.6846263408660889},{"id":"https://openalex.org/keywords/universal-code","display_name":"Universal code","score":0.6554596424102783},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.6325381994247437},{"id":"https://openalex.org/keywords/polynomial-code","display_name":"Polynomial code","score":0.6244131922721863},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.6243680119514465},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.5070524215698242},{"id":"https://openalex.org/keywords/dual-code","display_name":"Dual code","score":0.4861895442008972},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4859282076358795},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.48187121748924255},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.4815569221973419},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.479690283536911},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4717947840690613},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.46947869658470154},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.46058979630470276},{"id":"https://openalex.org/keywords/bijection","display_name":"Bijection","score":0.4598333537578583},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.38707655668258667},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38240066170692444},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37730783224105835},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.28041255474090576},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2611084282398224},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2127259373664856},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.16511425375938416},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1311379075050354},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.12981712818145752},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07804590463638306}],"concepts":[{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.8531002998352051},{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.7890176773071289},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.7514232397079468},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.7306755185127258},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.7085370421409607},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.6846263408660889},{"id":"https://openalex.org/C197294415","wikidata":"https://www.wikidata.org/wiki/Q4176366","display_name":"Universal code","level":5,"score":0.6554596424102783},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.6325381994247437},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.6244131922721863},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.6243680119514465},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.5070524215698242},{"id":"https://openalex.org/C73666251","wikidata":"https://www.wikidata.org/wiki/Q5310189","display_name":"Dual code","level":5,"score":0.4861895442008972},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4859282076358795},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.48187121748924255},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4815569221973419},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.479690283536911},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4717947840690613},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.46947869658470154},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.46058979630470276},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.4598333537578583},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.38707655668258667},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38240066170692444},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37730783224105835},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.28041255474090576},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2611084282398224},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2127259373664856},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.16511425375938416},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1311379075050354},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.12981712818145752},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07804590463638306},{"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.1109/isit.2019.8849775","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849775","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","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":7,"referenced_works":["https://openalex.org/W2018250045","https://openalex.org/W2046171733","https://openalex.org/W2060108852","https://openalex.org/W2169389509","https://openalex.org/W2742651484","https://openalex.org/W2963079252","https://openalex.org/W2963275264"],"related_works":["https://openalex.org/W2886619161","https://openalex.org/W2533621910","https://openalex.org/W2920861277","https://openalex.org/W2009670184","https://openalex.org/W2377508920","https://openalex.org/W2964219554","https://openalex.org/W2047382186","https://openalex.org/W2975172758","https://openalex.org/W2742651484","https://openalex.org/W3021352102"],"abstract_inverted_index":{"We":[0,26],"extend":[1],"the":[2,16,32,45,51,60,75,88,95],"concept":[3],"of":[4,12,18,34,62,90,97],"compact":[5,36,46,63,76],"code":[6,10,38,48,65,78,91],"trees,":[7,11,66,79],"i.e.,":[8],"canonical":[9],"Huffman":[13],"codes":[14],"to":[15,30,73],"case":[17],"binary":[19],"AIFV":[20,37,47,64,77],"(almost":[21],"instantaneous":[22],"fixed-to-variable":[23],"length)":[24],"codes.":[25],"give":[27,68],"an":[28,69],"algorithm":[29],"enumerate":[31],"number":[33],"all":[35],"trees":[39,49,92],"by":[40],"using":[41],"a":[42,86],"bijection":[43],"between":[44],"and":[50],"proper":[52],"sequences":[53],"defined":[54],"in":[55,94],"this":[56],"paper.":[57],"Based":[58],"on":[59],"enumeration":[61],"we":[67,84],"efficient":[70],"coding":[71],"scheme":[72],"describe":[74],"which":[80],"is":[81],"required":[82],"when":[83],"send":[85],"decoder":[87],"information":[89],"used":[93],"encoding":[96],"source":[98],"sequences.":[99]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}