{"id":"https://openalex.org/W7105608060","doi":"https://doi.org/10.1109/tit.2025.3632399","title":"Performance Bounds on Pliable Index Coding Using Absent Receivers","display_name":"Performance Bounds on Pliable Index Coding Using Absent Receivers","publication_year":2025,"publication_date":"2025-11-13","ids":{"openalex":"https://openalex.org/W7105608060","doi":"https://doi.org/10.1109/tit.2025.3632399"},"language":null,"primary_location":{"id":"doi:10.1109/tit.2025.3632399","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2025.3632399","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2512.06312","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Lawrence Ong","orcid":"https://orcid.org/0000-0001-7109-5308"},"institutions":[{"id":"https://openalex.org/I78757542","display_name":"University of Newcastle Australia","ror":"https://ror.org/00eae9z71","country_code":"AU","type":"education","lineage":["https://openalex.org/I78757542"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Lawrence Ong","raw_affiliation_strings":["School of Engineering, The University of Newcastle, Callaghan, NSW, Australia"],"raw_orcid":"https://orcid.org/0000-0001-7109-5308","affiliations":[{"raw_affiliation_string":"School of Engineering, The University of Newcastle, Callaghan, NSW, Australia","institution_ids":["https://openalex.org/I78757542"]}]},{"author_position":"middle","author":{"id":null,"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":["Department of Electrical and Computer Engineering, University of Cincinnati, Cincinnati, OH, USA"],"raw_orcid":"https://orcid.org/0000-0003-0517-1282","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Cincinnati, Cincinnati, OH, USA","institution_ids":["https://openalex.org/I63135867"]}]},{"author_position":"middle","author":{"id":null,"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":["School of Engineering and Technology, University of New South Wales, Canberra, ACT, Australia"],"raw_orcid":"https://orcid.org/0000-0002-9965-9483","affiliations":[{"raw_affiliation_string":"School of Engineering and Technology, University of New South Wales, Canberra, ACT, Australia","institution_ids":["https://openalex.org/I188329596","https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":null,"display_name":"J\u00f6rg Kliewer","orcid":"https://orcid.org/0000-0003-0942-8006"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J\u00f6rg Kliewer","raw_affiliation_strings":["Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ, USA"],"raw_orcid":"https://orcid.org/0000-0003-0942-8006","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ, USA","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"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.53804043,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"72","issue":"1","first_page":"149","last_page":"164"},"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.8450999855995178,"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.8450999855995178,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.12870000302791595,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.0035000001080334187,"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/decoding-methods","display_name":"Decoding methods","score":0.7950000166893005},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6966000199317932},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5623000264167786},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5353999733924866},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4068000018596649},{"id":"https://openalex.org/keywords/chain","display_name":"Chain (unit)","score":0.365200012922287},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.364300012588501}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7950000166893005},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6966000199317932},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5623000264167786},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5475000143051147},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5353999733924866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5331000089645386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4632999897003174},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4068000018596649},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3869999945163727},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.365200012922287},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.364300012588501},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3580000102519989},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.34599998593330383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27549999952316284},{"id":"https://openalex.org/C64185310","wikidata":"https://www.wikidata.org/wiki/Q843483","display_name":"Rate\u2013distortion theory","level":3,"score":0.275299996137619},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.26429998874664307},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.25859999656677246},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2025.3632399","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2025.3632399","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2512.06312","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.06312","pdf_url":"https://arxiv.org/pdf/2512.06312","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2512.06312","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.06312","pdf_url":"https://arxiv.org/pdf/2512.06312","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.48368459939956665,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G3206217619","display_name":null,"funder_award_id":"FT140100219","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G8424042779","display_name":null,"funder_award_id":"FT140101368","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"}],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,49,109],"characterise":[1,196],"bounds":[2,165,178],"on":[3,115,166,180],"the":[4,16,77,80,87,93,106,116,124,135,141,167,181,187,197,220],"optimal":[5,117,198],"broadcast":[6,118,168,199],"rate":[7,119,169,200],"for":[8,143,161,170,201],"a":[9,25,32,51,56,62,69,90,100,112,121,159],"few":[10],"classes":[11,172],"of":[12,18,89,123,126,134,140,173,183,189],"pliable-index-coding":[13,174],"instances.":[14,175],"Unlike":[15],"majority":[17],"currently":[19],"solved":[20],"instances,":[21],"which":[22],"belong":[23],"to":[24,86,105,205],"special":[26],"class":[27],"where":[28,219],"all":[29,130],"receivers":[30,136,185,210],"with":[31,92,203,211],"certain":[33],"side-information":[34,191,213,221],"cardinality":[35],"are":[36,223],"either":[37],"present":[38],"or":[39,186],"absent,":[40],"we":[41,96,194],"consider":[42],"more":[43],"general":[44],"instances":[45,202,218],"without":[46],"this":[47,148],"constraint.":[48],"devise":[50],"novel":[52],"algorithm":[53,142],"that":[54,64,111],"constructs":[55],"decoding":[57,81,132,145],"chain":[58,82,107],"by":[59,68,102],"iteratively":[60],"adding":[61,103],"message":[63,101],"can":[65],"be":[66],"decoded":[67],"receiver":[70,91],"whose":[71],"side":[72],"information":[73],"is":[74,120,150],"already":[75],"in":[76,154,225],"chain.":[78],"If":[79],"cannot":[83],"proceed":[84],"due":[85],"absence":[88],"required":[94],"messages,":[95,128],"<italic":[97],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[98],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">skip</i>":[99],"it":[104,156],"regardless.":[108],"prove":[110],"lower":[113,164,177],"bound":[114],"function":[122],"number":[125,182],"skipped":[127],"across":[129],"possible":[131],"choices":[133],"and":[137,206],"any":[138,212],"realisation":[139],"each":[144],"choice.":[146],"While":[147],"result":[149],"not":[151],"computationally":[152],"feasible":[153],"isolation,":[155],"serves":[157],"as":[158,215,217],"basis":[160],"deriving":[162],"explicit":[163],"specific":[171],"These":[176],"depend":[179],"absent":[184,209],"pattern":[188],"their":[190],"sets.":[192],"Specifically,":[193],"explicitly":[195],"up":[204],"including":[207],"four":[208],"pattern,":[214],"well":[216],"sets":[222],"nested":[224],"particular":[226],"ways.":[227]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-13T00:00:00"}