{"id":"https://openalex.org/W4388666872","doi":"https://doi.org/10.1109/allerton58177.2023.10313405","title":"An Improved Greedy Cover Algorithm for Pliable Index Coding","display_name":"An Improved Greedy Cover Algorithm for Pliable Index Coding","publication_year":2023,"publication_date":"2023-09-26","ids":{"openalex":"https://openalex.org/W4388666872","doi":"https://doi.org/10.1109/allerton58177.2023.10313405"},"language":"en","primary_location":{"id":"doi:10.1109/allerton58177.2023.10313405","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton58177.2023.10313405","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5093260740","display_name":"Sina Eghbal","orcid":null},"institutions":[{"id":"https://openalex.org/I63135867","display_name":"University of Cincinnati","ror":"https://ror.org/01e3m7079","country_code":"US","type":"education","lineage":["https://openalex.org/I63135867"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sina Eghbal","raw_affiliation_strings":["University of Cincinnati"],"affiliations":[{"raw_affiliation_string":"University of Cincinnati","institution_ids":["https://openalex.org/I63135867"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047865218","display_name":"Badri N. Vellambi","orcid":"https://orcid.org/0000-0003-0517-1282"},"institutions":[{"id":"https://openalex.org/I63135867","display_name":"University of Cincinnati","ror":"https://ror.org/01e3m7079","country_code":"US","type":"education","lineage":["https://openalex.org/I63135867"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Badri N. Vellambi","raw_affiliation_strings":["University of Cincinnati"],"affiliations":[{"raw_affiliation_string":"University of Cincinnati","institution_ids":["https://openalex.org/I63135867"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050821228","display_name":"Lawrence Ong","orcid":"https://orcid.org/0000-0001-7109-5308"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lawrence Ong","raw_affiliation_strings":["University of Newcastle"],"affiliations":[{"raw_affiliation_string":"University of Newcastle","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068612701","display_name":"Parastoo Sadeghi","orcid":"https://orcid.org/0000-0002-9965-9483"},"institutions":[{"id":"https://openalex.org/I188329596","display_name":"University of Canberra","ror":"https://ror.org/04s1nv328","country_code":"AU","type":"education","lineage":["https://openalex.org/I188329596"]},{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Parastoo Sadeghi","raw_affiliation_strings":["University of New South Wales,Canberra","University of New South Wales, Canberra"],"affiliations":[{"raw_affiliation_string":"University of New South Wales,Canberra","institution_ids":["https://openalex.org/I188329596","https://openalex.org/I31746571"]},{"raw_affiliation_string":"University of New South Wales, Canberra","institution_ids":["https://openalex.org/I188329596","https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5093260740"],"corresponding_institution_ids":["https://openalex.org/I63135867"],"apc_list":null,"apc_paid":null,"fwci":0.5988,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70022732,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9988999962806702,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.681857705116272},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6470948457717896},{"id":"https://openalex.org/keywords/weighting","display_name":"Weighting","score":0.6209060549736023},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5989508032798767},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5878737568855286},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5781174302101135},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.46098124980926514},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4212646484375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24810218811035156},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10317033529281616}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.681857705116272},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6470948457717896},{"id":"https://openalex.org/C183115368","wikidata":"https://www.wikidata.org/wiki/Q856577","display_name":"Weighting","level":2,"score":0.6209060549736023},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5989508032798767},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5878737568855286},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5781174302101135},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.46098124980926514},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4212646484375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24810218811035156},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10317033529281616},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C126838900","wikidata":"https://www.wikidata.org/wiki/Q77604","display_name":"Radiology","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/allerton58177.2023.10313405","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton58177.2023.10313405","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},{"id":"pmh:uon:54010","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.13/1495411","pdf_url":null,"source":{"id":"https://openalex.org/S4377196471","display_name":"NOVA (University of Newcastle Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78757542","host_organization_name":"University of Newcastle Australia","host_organization_lineage":["https://openalex.org/I78757542"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1512160561","https://openalex.org/W1586341635","https://openalex.org/W2012559125","https://openalex.org/W2130507035","https://openalex.org/W2171844485","https://openalex.org/W2180457036","https://openalex.org/W2262362834","https://openalex.org/W2266985944","https://openalex.org/W2755701769","https://openalex.org/W2786909933","https://openalex.org/W2897104207","https://openalex.org/W2963088729","https://openalex.org/W3099582795","https://openalex.org/W3106198739","https://openalex.org/W3122862363","https://openalex.org/W3198654262","https://openalex.org/W4386075100","https://openalex.org/W6768102460"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2277088917","https://openalex.org/W2035405850"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,28,72,77],"ImpGrCov":[3],"algorithm\u2013a":[4],"novel":[5],"algorithm":[6,37,75],"for":[7,12],"devising":[8],"binary":[9],"linear":[10],"codes":[11],"pliable":[13],"index":[14],"coding":[15],"that":[16,43],"have":[17],"lower":[18],"codelengths":[19],"than":[20],"those":[21],"devised":[22],"using":[23],"state-of-the-art":[24],"algorithms":[25],"such":[26],"as":[27],"greedy":[29],"cover,":[30],"and":[31],"random":[32],"cover":[33],"algorithms.":[34],"The":[35],"proposed":[36],"employs":[38],"a":[39,45,58],"novel,":[40],"improved":[41],"decoder":[42],"uses":[44],"representative":[46],"matrix":[47],"to":[48],"keep":[49],"track":[50],"of":[51,62],"relationships":[52],"between":[53],"undecoded":[54],"messages,":[55],"along":[56],"with":[57],"demand-based":[59],"exponential":[60],"weighting":[61],"receivers.":[63],"Simulations":[64],"indicate":[65],"10\u201319%":[66],"improvement":[67],"in":[68,76],"average":[69],"codelength":[70],"over":[71],"best":[73],"performing":[74],"literature.":[78]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
