{"id":"https://openalex.org/W2564917628","doi":"https://doi.org/10.1109/tit.2014.2354044","title":"Duality Codes and the Integrality Gap Bound for Index Coding","display_name":"Duality Codes and the Integrality Gap Bound for Index Coding","publication_year":2014,"publication_date":"2014-09-08","ids":{"openalex":"https://openalex.org/W2564917628","doi":"https://doi.org/10.1109/tit.2014.2354044","mag":"2564917628"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2014.2354044","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2014.2354044","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/A5101776391","display_name":"Hao Yu","orcid":"https://orcid.org/0000-0001-9543-6568"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hao Yu","raw_affiliation_strings":["Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029961049","display_name":"Michael J. Neely","orcid":"https://orcid.org/0000-0003-3524-1587"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael J. Neely","raw_affiliation_strings":["Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101776391"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":null,"apc_paid":null,"fwci":2.518,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.91058343,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"60","issue":"11","first_page":"7256","last_page":"7268"},"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/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.9229999780654907,"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/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.7139053344726562},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6700668334960938},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6405989527702332},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5973514318466187},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.5670197010040283},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.5543389916419983},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5435249209403992},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5342243313789368},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48818451166152954},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.46354052424430847},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.4386962056159973},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43784838914871216},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.43343618512153625},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4275881052017212},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4168446362018585},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4156375527381897},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28952252864837646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2543541193008423},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08322727680206299}],"concepts":[{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.7139053344726562},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6700668334960938},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6405989527702332},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5973514318466187},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.5670197010040283},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.5543389916419983},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5435249209403992},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5342243313789368},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48818451166152954},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.46354052424430847},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4386962056159973},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43784838914871216},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.43343618512153625},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4275881052017212},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4168446362018585},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4156375527381897},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28952252864837646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2543541193008423},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08322727680206299},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2014.2354044","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2014.2354044","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1653737407","https://openalex.org/W1964031838","https://openalex.org/W1975433230","https://openalex.org/W1992260716","https://openalex.org/W2012559125","https://openalex.org/W2022191808","https://openalex.org/W2048235391","https://openalex.org/W2056125869","https://openalex.org/W2104750217","https://openalex.org/W2105406958","https://openalex.org/W2116471929","https://openalex.org/W2123051422","https://openalex.org/W2130507035","https://openalex.org/W2133251572","https://openalex.org/W2160920137","https://openalex.org/W2161866053","https://openalex.org/W2165579188","https://openalex.org/W2171844485","https://openalex.org/W2505968561","https://openalex.org/W2963152923","https://openalex.org/W3011766368","https://openalex.org/W4237496336","https://openalex.org/W4293649750","https://openalex.org/W4293860921","https://openalex.org/W6637158907","https://openalex.org/W6683860718"],"related_works":["https://openalex.org/W99690574","https://openalex.org/W2790788195","https://openalex.org/W2962785705","https://openalex.org/W2121104987","https://openalex.org/W4293584096","https://openalex.org/W2009796757","https://openalex.org/W4252122881","https://openalex.org/W1531708257","https://openalex.org/W2593343445","https://openalex.org/W2171830873"],"abstract_inverted_index":{"This":[0,43,186],"paper":[1,187],"considers":[2],"a":[3,13,57,68,98,132,161,172],"base":[4],"station":[5],"that":[6,66,94,144,159,179],"delivers":[7],"packets":[8,32],"to":[9,89,140,171],"multiple":[10],"receivers":[11,19],"through":[12],"sequence":[14],"of":[15,30,40,75,101,167],"coded":[16],"transmissions.":[17,23],"All":[18],"overhear":[20],"the":[21,31,41,48,72,106,113,117,125,129,135,189],"same":[22],"Each":[24],"receiver":[25],"may":[26],"already":[27],"have":[28],"some":[29],"as":[33,47],"side":[34],"information,":[35],"and":[36,52,120,195,201],"requests":[37],"another":[38],"subset":[39],"packets.":[42],"problem":[44,51,169],"is":[45,64,87,95,110,138,147,157],"known":[46],"index":[49,192],"coding":[50,80,177],"can":[53],"be":[54,141],"represented":[55],"by":[56,97,112],"bipartite":[58],"digraph.":[59],"An":[60],"integer":[61,118,155,199],"linear":[62,84,103,122,203],"program":[63,119,156],"developed":[65],"provides":[67,160],"lower":[69],"bound":[70,93],"on":[71],"minimum":[73],"number":[74],"transmissions":[76],"required":[77],"for":[78,150],"any":[79],"algorithm.":[81],"Conversely,":[82],"its":[83,121],"programming":[85],"relaxation":[86],"shown":[88,139],"provide":[90],"an":[91,153],"upper":[92],"achievable":[96],"simple":[99],"form":[100],"vector":[102],"coding.":[104],"Thus,":[105],"information":[107],"theoretic":[108],"optimum":[109],"bounded":[111],"integrality":[114,136,163,196],"gap":[115,137],"between":[116,181,191,198],"relaxation.":[123],"In":[124],"special":[126],"case,":[127],"when":[128],"digraph":[130],"has":[131],"planar":[133],"structure,":[134],"zero,":[142],"so":[143],"exact":[145],"optimality":[146],"achieved.":[148],"Finally,":[149],"nonplanar":[151],"problems,":[152],"enhanced":[154],"constructed":[158],"smaller":[162],"gap.":[164],"The":[165],"dual":[166],"this":[168],"corresponds":[170],"more":[173],"sophisticated":[174],"partial":[175],"clique":[176],"strategy":[178],"time-shares":[180],"maximum":[182],"distance":[183],"separable":[184],"codes.":[185],"illuminates":[188],"relationship":[190],"coding,":[193],"duality,":[194],"gaps":[197],"programs":[200],"their":[202],"relaxations.":[204]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}