{"id":"https://openalex.org/W2962880109","doi":"https://doi.org/10.1109/isit.2016.7541273","title":"A polynomial-time algorithm for pliable index coding","display_name":"A polynomial-time algorithm for pliable index coding","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2962880109","doi":"https://doi.org/10.1109/isit.2016.7541273","mag":"2962880109"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541273","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","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/A5035185924","display_name":"Linqi Song","orcid":"https://orcid.org/0000-0003-2756-4984"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Linqi Song","raw_affiliation_strings":["Electrical Engineering Department, UCLA, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, UCLA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056591688","display_name":"Christina Fragouli","orcid":"https://orcid.org/0000-0003-1002-5829"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christina Fragouli","raw_affiliation_strings":["Electrical Engineering Department, UCLA, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, UCLA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035185924"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2147,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.83808721,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"120","last_page":"124"},"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9300000071525574,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9200000166893005,"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/coding","display_name":"Coding (social sciences)","score":0.7289332151412964},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5891844034194946},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.561787486076355},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48190122842788696},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47072163224220276},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4560215473175049},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43320342898368835},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4330004155635834},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.4188881814479828},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29542678594589233},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11821457743644714},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11478498578071594}],"concepts":[{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.7289332151412964},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5891844034194946},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.561787486076355},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48190122842788696},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47072163224220276},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4560215473175049},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43320342898368835},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4330004155635834},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.4188881814479828},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29542678594589233},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11821457743644714},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11478498578071594}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2016.7541273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541273","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1604547755","https://openalex.org/W1653737407","https://openalex.org/W1966169258","https://openalex.org/W2002226487","https://openalex.org/W2056125869","https://openalex.org/W2106630500","https://openalex.org/W2111425915","https://openalex.org/W2123051422","https://openalex.org/W2130507035","https://openalex.org/W2166785860","https://openalex.org/W4293649750","https://openalex.org/W6637158907"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W1862126075","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W4389362338","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W4389820491","https://openalex.org/W2521054645","https://openalex.org/W2113270940"],"abstract_inverted_index":{"Pliable":[0],"index":[1,117],"coding":[2,118],"considers":[3],"a":[4,19,80,92,112,125],"server":[5,33,55],"with":[6],"m":[7],"messages":[8],"and":[9,68,120],"n":[10],"clients":[11],"where":[12],"each":[13,38],"client":[14,39],"has":[15,51],"as":[16],"side":[17],"information":[18],"subset":[20],"of":[21,30,82,127],"the":[22,28,32,54,75,115,121],"messages.":[23],"We":[24,109],"seek":[25],"to":[26],"minimize":[27],"number":[29],"transmissions":[31,67,73],"should":[34],"make,":[35],"so":[36],"that":[37,53,95],"receives":[40],"(any)":[41],"one":[42],"message":[43],"she":[44],"does":[45],"not":[46],"already":[47],"have.":[48],"Previous":[49],"work":[50],"shown":[52],"can":[56],"achieve":[57],"this":[58,88],"using":[59],"at":[60,70],"most":[61],"O(log":[62,99],"<sup":[63,100],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[64,101],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[65,102],"(n))":[66,103],"needs":[69],"least":[71],"\u03a9(log(n))":[72],"in":[74],"worst":[76],"case,":[77],"but":[78],"finding":[79],"code":[81],"optimal":[83],"length":[84],"is":[85],"NP-hard.":[86],"In":[87],"paper,":[89],"we":[90],"design":[91],"polynomial-time":[93],"algorithm":[94],"uses":[96],"less":[97],"than":[98],"transmissions,":[104],"i.e.,":[105],"almost":[106],"worst-case":[107],"optimal.":[108],"also":[110],"establish":[111],"connection":[113],"between":[114],"pliable":[116],"problem":[119,123],"minrank":[122],"over":[124],"family":[126],"mixed":[128],"matrices.":[129]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2026-03-21T06:30:42.041108","created_date":"2025-10-10T00:00:00"}