{"id":"https://openalex.org/W7117300898","doi":"https://doi.org/10.1109/tit.2025.3648750","title":"Bounding the Optimal Length of Pliable Index Coding via a Hypergraph-Based Approach","display_name":"Bounding the Optimal Length of Pliable Index Coding via a Hypergraph-Based Approach","publication_year":2025,"publication_date":"2025-12-26","ids":{"openalex":"https://openalex.org/W7117300898","doi":"https://doi.org/10.1109/tit.2025.3648750"},"language":null,"primary_location":{"id":"doi:10.1109/tit.2025.3648750","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2025.3648750","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":["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/A5121320291","display_name":"B. Tulasi Sowjanya","orcid":null},"institutions":[{"id":"https://openalex.org/I64189192","display_name":"International Institute of Information Technology, Hyderabad","ror":"https://ror.org/05f11g639","country_code":"IN","type":"education","lineage":["https://openalex.org/I64189192"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"B. Tulasi Sowjanya","raw_affiliation_strings":["Signal Processing and Communications Research Center, International Institute of Information Technology Hyderabad, Hyderabad, India"],"raw_orcid":"https://orcid.org/0000-0001-6224-1123","affiliations":[{"raw_affiliation_string":"Signal Processing and Communications Research Center, International Institute of Information Technology Hyderabad, Hyderabad, India","institution_ids":["https://openalex.org/I64189192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007241265","display_name":"Visvesh Subramanian","orcid":null},"institutions":[{"id":"https://openalex.org/I2800120229","display_name":"Indian Navy","ror":"https://ror.org/02sxcbg21","country_code":"IN","type":"government","lineage":["https://openalex.org/I2800120229"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Visvesh Subramanian","raw_affiliation_strings":["IdeaForge Technology Ltd., Navi Mumbai, Maharashtra, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IdeaForge Technology Ltd., Navi Mumbai, Maharashtra, India","institution_ids":["https://openalex.org/I2800120229"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5121111618","display_name":"Prasad Krishnan","orcid":null},"institutions":[{"id":"https://openalex.org/I64189192","display_name":"International Institute of Information Technology, Hyderabad","ror":"https://ror.org/05f11g639","country_code":"IN","type":"education","lineage":["https://openalex.org/I64189192"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Prasad Krishnan","raw_affiliation_strings":["Signal Processing and Communications Research Center, International Institute of Information Technology Hyderabad, Hyderabad, India"],"raw_orcid":"https://orcid.org/0000-0001-9182-6278","affiliations":[{"raw_affiliation_string":"Signal Processing and Communications Research Center, International Institute of Information Technology Hyderabad, Hyderabad, India","institution_ids":["https://openalex.org/I64189192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5121320291"],"corresponding_institution_ids":["https://openalex.org/I64189192"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63823227,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"72","issue":"3","first_page":"1569","last_page":"1589"},"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.9790999889373779,"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.9790999889373779,"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.003800000064074993,"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.002199999988079071,"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/hypergraph","display_name":"Hypergraph","score":0.7633000016212463},{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.7184000015258789},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6723999977111816},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6105999946594238},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.46129998564720154},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.44749999046325684},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.39480000734329224},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3806000053882599}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7633000016212463},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.7184000015258789},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6723999977111816},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6105999946594238},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5218999981880188},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.46129998564720154},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44749999046325684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4196000099182129},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.39480000734329224},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3874000012874603},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38119998574256897},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3806000053882599},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.374099999666214},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.3644999861717224},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3610000014305115},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3158000111579895},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.3089999854564667},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.3068999946117401},{"id":"https://openalex.org/C2776937656","wikidata":"https://www.wikidata.org/wiki/Q2229669","display_name":"Nesting (process)","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2797999978065491},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27390000224113464},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2637999951839447}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2025.3648750","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2025.3648750","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4765479843","display_name":null,"funder_award_id":"CRG/2023/008696","funder_id":"https://openalex.org/F4320334771","funder_display_name":"Science and Engineering Research Board"}],"funders":[{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2010213837","https://openalex.org/W2012559125","https://openalex.org/W2059613941","https://openalex.org/W2105406958","https://openalex.org/W2112505974","https://openalex.org/W2180457036","https://openalex.org/W2470734855","https://openalex.org/W2755701769","https://openalex.org/W2786909933","https://openalex.org/W2975114661","https://openalex.org/W2975714177","https://openalex.org/W2981259770","https://openalex.org/W2989813225","https://openalex.org/W3126772816","https://openalex.org/W4310902965","https://openalex.org/W4386075100","https://openalex.org/W4388666872"],"related_works":[],"abstract_inverted_index":{"In":[0,92],"pliable":[1],"index":[2],"coding":[3],"(PICOD),":[4],"a":[5,12,17,21,28,55,97,126,186,195,285,365],"number":[6,216,237],"of":[7,23,31,51,57,76,155,287,354,368,399],"clients":[8,68,110],"are":[9,69,86,253],"connected":[10],"via":[11,324],"noise-free":[13],"broadcast":[14,61],"channel":[15],"to":[16,100,174,290,406],"server":[18,35,64],"which":[19,134,252],"has":[20,27],"list":[22],"messages.":[24],"Each":[25],"client":[26],"unique":[29],"subset":[30],"messages":[32,116],"at":[33,142],"the":[34,46,63,72,87,152,159,166,190,201,205,214,235,261,293,296,303,317,355,360,381,396,407,414],"as":[36],"side-information,":[37],"and":[38,78,104,275,302,331,370],"requests":[39],"for":[40,107,130,179,189,245,265,276],"any":[41,156],"one":[42],"message":[43],"not":[44,219],"in":[45,90,158,255,352,395,416,424],"side-information.":[47],"A":[48],"PICOD":[49,77,80,167,192,202,247,263,288,305,319,329,400],"scheme":[50,139,178],"length":[52,75,85,141,193,306,357],"\u2113":[53,58],"is":[54,151,218],"set":[56],"encoded":[59],"transmissions":[60],"from":[62,307,321,364],"such":[65],"that":[66,82,164,292,339],"all":[67],"satisfied.":[70],"Finding":[71],"optimal":[73,191,262],"(minimum)":[74],"designing":[79],"schemes":[81],"have":[83],"small":[84],"fundamental":[88],"questions":[89],"PICOD.":[91],"this":[93,172],"paper,":[94],"we":[95,239,283,315],"use":[96],"hypergraph-based":[98],"approach":[99],"derive":[101],"new":[102,115,196],"achievability":[103],"converse":[105],"results":[106,404],"PICOD(t),":[108],"where":[109,147],"request":[111],"<italic":[112,119,161],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[113,120,145,149,162,181,211,269,300,409],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">t</i>":[114,121],"(for":[117],"some":[118,228,246,256,344,425],"\u2265":[122],"1).":[123],"We":[124,169,183,258,337],"present":[125,284],"simple":[127],"greedy":[128],"algorithm":[129,309,363,383],"PICOD(1),":[131],"termed":[132],"DelGreedy,":[133],"gives":[135],"an":[136,176,392],"achievable":[137,177,304,318],"linear":[138],"with":[140,200,249,267,278,334,413],"most":[143],"\u0394(<italic":[144,148,268],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">H</i>),":[146],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">H</i>)":[150,270,301],"maximum":[153],"degree":[154],"vertex":[157],"hypergraph":[160,203],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">H</i>":[163],"represents":[165],"problem.":[168],"then":[170],"extend":[171,405],"idea":[173],"obtain":[175,241],"PICOD(<italic":[180,408],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">t</i>).":[182],"also":[184,240,259],"give":[185],"lower":[187,243,297],"bound":[188,217,298],"using":[194,234],"structural":[197],"parameter":[198],"associated":[199],"called":[204],"nesting":[206,215,236],"number,":[207],"denoted":[208],"by":[209],"\u03b7(<italic":[210,299],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">H</i>).":[212],"While":[213],"stronger":[220],"than":[221,343,350,378,389],"previously":[222],"known":[223],"bounds,":[224],"it":[225,333],"can":[226,310],"provide":[227],"computational":[229],"advantages":[230],"over":[231,418],"them.":[232],"Also,":[233],"bound,":[238],"novel":[242],"bounds":[244],"problems":[248,266,277,289],"special":[250],"structures,":[251],"tight":[254],"cases.":[257,426],"characterize":[260],"lengths":[264,320,375],"\u2208":[271],"{1,":[272],"2,":[273],"3},":[274],"upto":[279],"three":[280],"clients.":[281],"Further,":[282],"class":[286],"show":[291],"gap":[294],"between":[295],"DelGreedy":[308,340,382],"be":[311],"arbitrarily":[312],"large.":[313],"Finally,":[314],"demonstrate":[316],"our":[322],"algorithms":[323,420],"simulations":[325],"on":[326],"randomly":[327],"generated":[328],"problems,":[330],"compare":[332],"existing":[335,345],"algorithms.":[336],"observe":[338],"performs":[341,372],"better":[342],"algorithms,":[346],"while":[347],"being":[348,421],"worse":[349],"others,":[351],"terms":[353],"code":[356,401],"achieved.":[358],"Specifically,":[359],"greedy-cover":[361],"based":[362],"prior":[366],"work":[367],"Brahma":[369],"Fragouli":[371],"better,":[373],"achieving":[374],"1.5x-2x":[376],"smaller":[377],"DelGreedy.":[379],"However,":[380],"demonstrates":[384],"1.5x-3x":[385],"faster":[386],"running":[387],"times":[388],"GRCOV,":[390],"providing":[391],"alternative":[393],"point":[394],"rate-computation":[397],"tradeoff":[398],"design.":[402],"These":[403],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">t</i>)":[410],"scenario":[411],"also,":[412],"improvements":[415],"computation-time":[417],"pre-existing":[419],"more":[422],"dramatic":[423]},"counts_by_year":[],"updated_date":"2026-02-20T06:14:18.993340","created_date":"2025-12-26T00:00:00"}