{"id":"https://openalex.org/W4289655198","doi":"https://doi.org/10.1109/isit50566.2022.9834710","title":"Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes","display_name":"Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655198","doi":"https://doi.org/10.1109/isit50566.2022.9834710"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834710","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834710","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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/A5018411781","display_name":"Hoover H. F. Yin","orcid":"https://orcid.org/0000-0002-0268-0500"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hoover H. F. Yin","raw_affiliation_strings":["The Chinese University of Hong Kong,Institute of Network Coding"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong,Institute of Network Coding","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101799360","display_name":"Harry W. H. Wong","orcid":"https://orcid.org/0009-0001-0443-2041"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Harry W. H. Wong","raw_affiliation_strings":["The Chinese University of Hong Kong,Department of Information Engineering"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong,Department of Information Engineering","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081396552","display_name":"Mehrdad Tahernia","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mehrdad Tahernia","raw_affiliation_strings":["Independent Researcher"],"affiliations":[{"raw_affiliation_string":"Independent Researcher","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034642945","display_name":"Russell W. F. Lai","orcid":"https://orcid.org/0000-0001-9126-1887"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Russell W. F. Lai","raw_affiliation_strings":["Friedrich-Alexander-Universität Erlangen-Nürnberg,Chair of Applied Cryptography"],"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander-Universität Erlangen-Nürnberg,Chair of Applied Cryptography","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5018411781"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":0.3118,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.49676794,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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.9997000098228455,"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.9976000189781189,"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/T11567","display_name":"semigroups and automata theory","score":0.9908000230789185,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.8956735134124756},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.7497559189796448},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6303994655609131},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6118839979171753},{"id":"https://openalex.org/keywords/cyclic-prefix","display_name":"Cyclic prefix","score":0.5574750304222107},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4731487035751343},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4569438397884369},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44680821895599365},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.4375704824924469},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4273304343223572},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3650783896446228},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3246139585971832},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2340162992477417},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.16230973601341248},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.09219905734062195},{"id":"https://openalex.org/keywords/orthogonal-frequency-division-multiplexing","display_name":"Orthogonal frequency-division multiplexing","score":0.059427499771118164}],"concepts":[{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.8956735134124756},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.7497559189796448},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6303994655609131},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6118839979171753},{"id":"https://openalex.org/C2778775284","wikidata":"https://www.wikidata.org/wiki/Q5198224","display_name":"Cyclic prefix","level":4,"score":0.5574750304222107},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4731487035751343},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4569438397884369},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44680821895599365},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.4375704824924469},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4273304343223572},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3650783896446228},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3246139585971832},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2340162992477417},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.16230973601341248},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.09219905734062195},{"id":"https://openalex.org/C40409654","wikidata":"https://www.wikidata.org/wiki/Q375889","display_name":"Orthogonal frequency-division multiplexing","level":3,"score":0.059427499771118164},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834710","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834710","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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":19,"referenced_works":["https://openalex.org/W80079294","https://openalex.org/W1519253855","https://openalex.org/W1995875735","https://openalex.org/W2046419776","https://openalex.org/W2049950814","https://openalex.org/W2060108852","https://openalex.org/W2070214433","https://openalex.org/W2121443245","https://openalex.org/W2127147964","https://openalex.org/W2158894482","https://openalex.org/W2163659698","https://openalex.org/W2963079252","https://openalex.org/W2976570834","https://openalex.org/W3198765985","https://openalex.org/W3216766741","https://openalex.org/W4232099444","https://openalex.org/W4289655198","https://openalex.org/W4298877056","https://openalex.org/W6631215974"],"related_works":["https://openalex.org/W54192826","https://openalex.org/W2094225155","https://openalex.org/W1650274465","https://openalex.org/W2952674952","https://openalex.org/W2074308207","https://openalex.org/W2566439177","https://openalex.org/W2023299357","https://openalex.org/W2395357979","https://openalex.org/W4244214420","https://openalex.org/W2795037468"],"abstract_inverted_index":{"The":[0],"theory":[1,11],"of":[2,12,39,83,104],"multichannel":[3],"prefix":[4,13,18,51,64,84,112],"codes":[5,19,46,65,107],"aims":[6],"to":[7],"generalize":[8],"the":[9,24,77,81,88,98,102],"classical":[10],"codes.":[14,85,113],"Although":[15],"single-":[16],"two-channel":[17],"always":[20],"have":[21,68],"decoding":[22],"trees,":[23],"same":[25],"cannot":[26],"be":[27],"said":[28],"when":[29],"there":[30,43],"are":[31,48,109],"more":[32],"than":[33],"two":[34],"channels.":[35],"One":[36],"question":[37],"is":[38],"theoretical":[40],"interest:":[41],"Do":[42],"exist":[44],"optimal":[45,50,105,111],"that":[47,108],"not":[49,110],"codes?":[52],"Existing":[53],"literature,":[54],"focused":[55],"on":[56,97],"generalizing":[57],"single-channel":[58,70],"results,":[59],"covered":[60],"little":[61],"about":[62],"non-tree-decodable":[63,89],"since":[66],"they":[67],"no":[69],"counterparts.":[71],"In":[72],"this":[73],"work,":[74],"we":[75,91],"study":[76],"fundamental":[78],"reason":[79],"behind":[80],"non-tree-decodability":[82],"By":[86],"investigating":[87],"structure,":[90],"obtain":[92],"a":[93],"general":[94],"sufficient":[95],"condition":[96],"channel":[99],"alphabets":[100],"for":[101],"existence":[103],"tree-decodable":[106]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}