{"id":"https://openalex.org/W2742651484","doi":"https://doi.org/10.1109/isit.2017.8006709","title":"Coding of binary AIFV code trees","display_name":"Coding of binary AIFV code trees","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2742651484","doi":"https://doi.org/10.1109/isit.2017.8006709","mag":"2742651484"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006709","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006709","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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/A5019589730","display_name":"Kentaro Sumigawa","orcid":null},"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":true,"raw_author_name":"Kentaro Sumigawa","raw_affiliation_strings":["Department of Mathematical Informatics, The University of Tokyo"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Informatics, The University of Tokyo","institution_ids":["https://openalex.org/I74801974"]}]},{"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":["Department of Complexity Science, The University of Tokyo"],"affiliations":[{"raw_affiliation_string":"Department of Complexity Science, The University of Tokyo","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019589730"],"corresponding_institution_ids":["https://openalex.org/I74801974"],"apc_list":null,"apc_paid":null,"fwci":0.195,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.61579864,"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.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/T12029","display_name":"DNA and Biological Computing","score":0.9750000238418579,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.970300018787384,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.9566192626953125},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.8127367496490479},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.7189806699752808},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.7073774337768555},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.6965720653533936},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5869811773300171},{"id":"https://openalex.org/keywords/tunstall-coding","display_name":"Tunstall coding","score":0.5856550335884094},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.5597993731498718},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5480586886405945},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5419323444366455},{"id":"https://openalex.org/keywords/bijection","display_name":"Bijection","score":0.5153700709342957},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5018978118896484},{"id":"https://openalex.org/keywords/universal-code","display_name":"Universal code","score":0.4832771122455597},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4672923684120178},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4581197500228882},{"id":"https://openalex.org/keywords/constant-weight-code","display_name":"Constant-weight code","score":0.4567784368991852},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.44337257742881775},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4333701431751251},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4282147288322449},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.40480682253837585},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.3327585458755493},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.31579285860061646},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.3148873448371887},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.2959718108177185},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.21406406164169312},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.18553784489631653},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.15615469217300415},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.14936953783035278}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9566192626953125},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.8127367496490479},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.7189806699752808},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.7073774337768555},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.6965720653533936},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5869811773300171},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.5856550335884094},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.5597993731498718},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5480586886405945},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5419323444366455},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.5153700709342957},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5018978118896484},{"id":"https://openalex.org/C197294415","wikidata":"https://www.wikidata.org/wiki/Q4176366","display_name":"Universal code","level":5,"score":0.4832771122455597},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4672923684120178},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4581197500228882},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.4567784368991852},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.44337257742881775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4333701431751251},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4282147288322449},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.40480682253837585},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.3327585458755493},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.31579285860061646},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3148873448371887},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.2959718108177185},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.21406406164169312},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.18553784489631653},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.15615469217300415},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.14936953783035278},{"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/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.2017.8006709","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006709","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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":13,"referenced_works":["https://openalex.org/W1964195795","https://openalex.org/W2040889864","https://openalex.org/W2045191540","https://openalex.org/W2060108852","https://openalex.org/W2070214433","https://openalex.org/W2086987876","https://openalex.org/W2099953837","https://openalex.org/W2137270090","https://openalex.org/W2169476932","https://openalex.org/W2583343534","https://openalex.org/W2963079252","https://openalex.org/W2963275264","https://openalex.org/W6733229216"],"related_works":["https://openalex.org/W2166346116","https://openalex.org/W2497702133","https://openalex.org/W2975172758","https://openalex.org/W2045111122","https://openalex.org/W1984094856","https://openalex.org/W2920861277","https://openalex.org/W2360576622","https://openalex.org/W2055286490","https://openalex.org/W2216532275","https://openalex.org/W2742651484"],"abstract_inverted_index":{"Binary":[0],"AIFV":[1,51,73,117],"codes,":[2,11,41],"which":[3,42,97],"can":[4],"attain":[5],"better":[6],"compression":[7],"rate":[8,127],"than":[9,131],"Huffman":[10,40],"uses":[12],"two":[13,81],"code":[14,37,52,74],"trees":[15,38,53,75],"that":[16,66],"may":[17],"have":[18,54],"incomplete":[19],"internal":[20,29],"nodes,":[21],"and":[22,76,79],"source":[23],"symbols":[24],"are":[25,43,47],"assigned":[26],"to":[27,33,84],"some":[28],"nodes":[30],"in":[31,59],"addition":[32],"leaves.":[34],"Although":[35],"the":[36,50,125,134],"of":[39,133],"full":[44],"binary":[45,72],"trees,":[46],"well":[48],"studied,":[49],"not":[55],"been":[56],"yet":[57],"studied":[58],"detail.":[60],"In":[61],"this":[62],"paper,":[63],"we":[64],"show":[65],"there":[67],"exists":[68],"a":[69,92,109,115],"bijection":[70],"between":[71],"Schroder":[77,86],"paths,":[78],"give":[80],"coding":[82,95,112,126,136],"schemes":[83],"represent":[85],"paths.":[87],"The":[88,105,119],"first":[89],"one":[90,107],"is":[91,108],"fixed":[93],"length":[94,111],"scheme,":[96],"has":[98,128],"O(n":[99],"<sup":[100],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[101],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[102],")":[103],"time-complexity.":[104],"second":[106],"variable":[110],"scheme":[113],"using":[114],"simple":[116],"code.":[118],"latter":[120],"attains":[121],"O(n)":[122],"time-complexity,":[123],"but":[124],"loss":[129],"less":[130],"4.1%":[132],"optimal":[135],"rate.":[137]},"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},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}