{"id":"https://openalex.org/W4416514171","doi":"https://doi.org/10.1109/itw62417.2025.11240301","title":"Uniquely-Decodable Coding for Network Function Computation","display_name":"Uniquely-Decodable Coding for Network Function Computation","publication_year":2025,"publication_date":"2025-09-29","ids":{"openalex":"https://openalex.org/W4416514171","doi":"https://doi.org/10.1109/itw62417.2025.11240301"},"language":null,"primary_location":{"id":"doi:10.1109/itw62417.2025.11240301","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw62417.2025.11240301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Information Theory Workshop (ITW)","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/A5027528912","display_name":"Xuan Guang","orcid":"https://orcid.org/0000-0002-0928-421X"},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuan Guang","raw_affiliation_strings":["Nankai University,School of Mathematical Sciences and LPMC,Tianjin,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nankai University,School of Mathematical Sciences and LPMC,Tianjin,China","institution_ids":["https://openalex.org/I205237279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101239958","display_name":"Jihang Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jihang Yang","raw_affiliation_strings":["Nankai University,School of Mathematical Sciences and LPMC,Tianjin,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nankai University,School of Mathematical Sciences and LPMC,Tianjin,China","institution_ids":["https://openalex.org/I205237279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043058794","display_name":"Ruze Zhang","orcid":"https://orcid.org/0009-0003-2995-2654"},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ruze Zhang","raw_affiliation_strings":["Nankai University,School of Mathematical Sciences and LPMC,Tianjin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nankai University,School of Mathematical Sciences and LPMC,Tianjin","institution_ids":["https://openalex.org/I205237279"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.36393995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9088000059127808,"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"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9088000059127808,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.03869999945163727,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.00839999970048666,"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/linear-network-coding","display_name":"Linear network coding","score":0.6744999885559082},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6287999749183655},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6097999811172485},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5047000050544739},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.45820000767707825},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.42239999771118164},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4156000018119812},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.39649999141693115},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3573000133037567}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6744999885559082},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6287999749183655},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6097999811172485},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5407000184059143},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5047000050544739},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.45820000767707825},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4413999915122986},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.42239999771118164},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4156000018119812},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.39649999141693115},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.390500009059906},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3596000075340271},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3573000133037567},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3549000024795532},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.35440000891685486},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.3513000011444092},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.35120001435279846},{"id":"https://openalex.org/C32946077","wikidata":"https://www.wikidata.org/wiki/Q618079","display_name":"Network analysis","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3305000066757202},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.323199987411499},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.30799999833106995},{"id":"https://openalex.org/C193415008","wikidata":"https://www.wikidata.org/wiki/Q639681","display_name":"Network architecture","level":2,"score":0.2928999960422516},{"id":"https://openalex.org/C139940560","wikidata":"https://www.wikidata.org/wiki/Q290036","display_name":"Network simulation","level":2,"score":0.29030001163482666},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.2824999988079071},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C104122410","wikidata":"https://www.wikidata.org/wiki/Q1416406","display_name":"Network model","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C137753397","wikidata":"https://www.wikidata.org/wiki/Q2434424","display_name":"Network science","level":3,"score":0.2556999921798706},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw62417.2025.11240301","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw62417.2025.11240301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W108696806","https://openalex.org/W1998069195","https://openalex.org/W2005007104","https://openalex.org/W2115602633","https://openalex.org/W2119336214","https://openalex.org/W2123976939","https://openalex.org/W2129119419","https://openalex.org/W2134804253","https://openalex.org/W2169369793","https://openalex.org/W2255519029","https://openalex.org/W2545365617","https://openalex.org/W2885547698","https://openalex.org/W2886140273","https://openalex.org/W2962789451","https://openalex.org/W2963843956","https://openalex.org/W2963928051","https://openalex.org/W2963944130","https://openalex.org/W2964259786","https://openalex.org/W4205523767","https://openalex.org/W4205946516","https://openalex.org/W4212896000","https://openalex.org/W4387092849","https://openalex.org/W4402125744"],"related_works":[],"abstract_inverted_index":{"The":[0],"problem":[1,197],"of":[2,32,51,70,87,115,157,198],"network":[3,10,45,55,59,72,76,95,117,128,159,166],"function":[4,46,100],"computation":[5,47],"over":[6,186,203],"a":[7,18,20,29,136,143,149,183,204],"directed":[8],"acyclic":[9],"is":[11,81,162,182],"investigated":[12],"in":[13,93],"this":[14,62,179,192],"paper.":[15],"In":[16,61,105],"such":[17],"network,":[19],"sink":[21],"node":[22],"desires":[23],"to":[24,164,195],"compute":[25],"with":[26,102],"zero":[27,103],"error":[28],"target":[30,99,132,173],"function,":[31],"which":[33,161],"the":[34,82,94,98,106,112,127,131,154,187,196],"inputs":[35],"are":[36],"generated":[37],"at":[38],"multiple":[39],"source":[40],"nodes.":[41],"Existing":[42],"research":[43],"on":[44,66,90,111,125,142,153],"explores":[48],"two":[49],"types":[50],"problems":[52],"regarding":[53],"block-length":[54],"codes":[56,118],"and":[57,171],"variable-length":[58,71],"codes.":[60],"paper,":[63],"we":[64,147,176],"concentrate":[65],"an":[67,200],"important":[68],"class":[69],"codes,":[73,77,160],"namely":[74],"uniquely-decodable":[75,116,158],"whose":[78],"computing":[79,97,113,155,199],"rate":[80],"maximum":[83],"average":[84],"expected":[85],"number":[86],"bits":[88],"transmitted":[89],"all":[91],"edges":[92],"for":[96],"once":[101],"error.":[104],"existing":[107],"papers,":[108],"lower":[109,151,180,193],"bounds":[110],"capacity":[114,156],"have":[119],"been":[120],"proposed":[121],"under":[122],"certain":[123],"constraints":[124],"either":[126],"topology":[129],"or":[130],"function.":[133],"By":[134],"developing":[135],"novel":[137],"graph":[138],"coloring":[139],"approach":[140],"based":[141],"cut-set":[144],"strong":[145],"partition,":[146],"obtain":[148],"general":[150],"bound":[152,181,194],"applicable":[163],"arbitrary":[165,168,172],"topologies,":[167],"information":[169],"sources":[170],"functions.":[174],"Furthermore,":[175],"show":[177],"that":[178],"strict":[184],"improvement":[185],"previous":[188],"results":[189],"by":[190],"applying":[191],"arithmetic":[201],"sum":[202],"diamond":[205],"network.":[206]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-23T00:00:00"}