{"id":"https://openalex.org/W3215457806","doi":"https://doi.org/10.1109/lcomm.2021.3129519","title":"Maximum Decoding Clique Based Maximum Weight Vertex Search Algorithm for Buffered Instantly Decodable Network Codes","display_name":"Maximum Decoding Clique Based Maximum Weight Vertex Search Algorithm for Buffered Instantly Decodable Network Codes","publication_year":2021,"publication_date":"2021-11-19","ids":{"openalex":"https://openalex.org/W3215457806","doi":"https://doi.org/10.1109/lcomm.2021.3129519","mag":"3215457806"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2021.3129519","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2021.3129519","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","raw_type":"journal-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/A5084958876","display_name":"Zhonghui Mei","orcid":"https://orcid.org/0000-0003-4274-5521"},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhonghui Mei","raw_affiliation_strings":["College of Telecommunication and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing, China"],"raw_orcid":"https://orcid.org/0000-0003-4274-5521","affiliations":[{"raw_affiliation_string":"College of Telecommunication and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing, China","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112112429","display_name":"Xiaoyan Zhou","orcid":"https://orcid.org/0000-0002-8289-1139"},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoyan Zhou","raw_affiliation_strings":["College of Telecommunication and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Telecommunication and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing, China","institution_ids":["https://openalex.org/I41198531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I41198531"],"apc_list":null,"apc_paid":null,"fwci":1.0634,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78880035,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"26","issue":"2","first_page":"229","last_page":"233"},"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.9998999834060669,"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.9998999834060669,"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/T12791","display_name":"Full-Duplex Wireless Communications","score":0.957099974155426,"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/T11478","display_name":"Caching and Content Delivery","score":0.9300000071525574,"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/clique-problem","display_name":"Clique problem","score":0.882246732711792},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.8429234027862549},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8182706832885742},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.593375027179718},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5704643130302429},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5247640609741211},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.4952923357486725},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.47674760222435},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4744250178337097},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4714955687522888},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4412749111652374},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4404492974281311},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4107341170310974},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3114945888519287},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25703519582748413},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21597421169281006},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.156272292137146},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.11210155487060547},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.11091175675392151},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.08349061012268066}],"concepts":[{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.882246732711792},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.8429234027862549},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8182706832885742},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.593375027179718},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5704643130302429},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5247640609741211},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.4952923357486725},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.47674760222435},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4744250178337097},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4714955687522888},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4412749111652374},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4404492974281311},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4107341170310974},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3114945888519287},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25703519582748413},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21597421169281006},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.156272292137146},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.11210155487060547},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.11091175675392151},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.08349061012268066},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcomm.2021.3129519","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2021.3129519","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1522859055","https://openalex.org/W1975409994","https://openalex.org/W1980811884","https://openalex.org/W2604791925","https://openalex.org/W2744029913","https://openalex.org/W2892213929","https://openalex.org/W2895787695","https://openalex.org/W2991548794"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2102627024","https://openalex.org/W2182594114","https://openalex.org/W2085052822","https://openalex.org/W2357077655"],"abstract_inverted_index":{"The":[0,66],"traditional":[1],"instantly":[2,34],"decodable":[3,11,35],"network":[4,28,36,53],"coding":[5,29,37],"(IDNC)":[6],"schemes":[7],"discard":[8],"the":[9,17,45,62,78,88,96,122,134,141],"non-instantly":[10],"packets":[12,50],"(NIDPs),":[13],"which":[14,81],"results":[15,126],"in":[16,77],"loss":[18],"of":[19,75],"useful":[20],"information.":[21],"In":[22],"this":[23],"letter,":[24],"we":[25],"consider":[26],"a":[27,57,73,103],"scheme":[30],"named":[31,106],"as":[32,72,95,107],"buffered":[33],"(B-IDNC)":[38],"where":[39],"each":[40],"receiving":[41],"node":[42],"can":[43,82,132],"cache":[44],"NIDPs":[46],"containing":[47],"two":[48],"unreceived":[49],"for":[51],"subsequent":[52],"decoding,":[54],"and":[55,102],"give":[56],"decoding":[58,64,68,91,109,137],"algorithm":[59,105,117,131],"by":[60],"utilizing":[61],"maximum":[63,67,97,108,112],"clique.":[65],"clique":[69,100,110],"is":[70,118],"defined":[71],"subset":[74],"vertices":[76],"IDNC":[79,143],"graph,":[80],"be":[83],"decoded":[84],"together.":[85],"We":[86],"approximate":[87],"average":[89,135],"packet":[90,136],"delay":[92,138],"minimization":[93],"problem":[94],"weight":[98,113],"encoding":[99],"problem,":[101],"heuristic":[104],"based":[111],"vertex":[114],"(MDC-MWV)":[115],"searching":[116],"proposed":[119,130],"to":[120],"solve":[121],"approximated":[123],"problem.":[124],"Simulation":[125],"show":[127],"that":[128],"our":[129],"reduce":[133],"compared":[139],"with":[140],"conventional":[142],"schemes.":[144]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}