{"id":"https://openalex.org/W2056125869","doi":"https://doi.org/10.1109/tit.2009.2023702","title":"Nonlinear Index Coding Outperforming the Linear Optimum","display_name":"Nonlinear Index Coding Outperforming the Linear Optimum","publication_year":2009,"publication_date":"2009-07-18","ids":{"openalex":"https://openalex.org/W2056125869","doi":"https://doi.org/10.1109/tit.2009.2023702","mag":"2056125869"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2009.2023702","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2009.2023702","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/A5047720470","display_name":"Eyal Lubetzky","orcid":"https://orcid.org/0000-0002-2281-3542"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Eyal Lubetzky","raw_affiliation_strings":["Theory Group, Microsoft Research Limited, Redmond, WA, USA","Theor. Group, Microsoft Res., Redmond, WA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Theory Group, Microsoft Research Limited, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Theor. Group, Microsoft Res., Redmond, WA, USA#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083816706","display_name":"Uri Stav","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Uri Stav","raw_affiliation_strings":["School of Computer Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel-Aviv University, Tel-Aviv, Israel","School of Computer Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel-Aviv University, Tel-Aviv, Ramat-Aviv, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"School of Computer Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel-Aviv University, Tel-Aviv, Ramat-Aviv, Israel#TAB#","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047720470"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":7.6135,"has_fulltext":false,"cited_by_count":146,"citation_normalized_percentile":{"value":0.97409503,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":"55","issue":"8","first_page":"3544","last_page":"3551"},"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.9997000098228455,"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.9997000098228455,"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.9980000257492065,"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.9952999949455261,"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/computer-science","display_name":"Computer science","score":0.48862224817276},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.469030499458313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.406225323677063},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3526512384414673},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3353104591369629},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.334760844707489},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.3327678442001343},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2761206030845642},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.133466899394989}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48862224817276},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.469030499458313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.406225323677063},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3526512384414673},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3353104591369629},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.334760844707489},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.3327678442001343},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2761206030845642},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.133466899394989}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2009.2023702","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2009.2023702","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2017103001","https://openalex.org/W2030052209","https://openalex.org/W2044716089","https://openalex.org/W2054996571","https://openalex.org/W2064197162","https://openalex.org/W2071801393","https://openalex.org/W2072475112","https://openalex.org/W2078289947","https://openalex.org/W2105406958","https://openalex.org/W2133251572","https://openalex.org/W2164684058"],"related_works":["https://openalex.org/W2357241418","https://openalex.org/W2086064646","https://openalex.org/W2119135658","https://openalex.org/W2115485936","https://openalex.org/W3022131925","https://openalex.org/W2349174110","https://openalex.org/W1597238586","https://openalex.org/W1536405386","https://openalex.org/W2326857978","https://openalex.org/W1990780094"],"abstract_inverted_index":{"The":[0,43,123],"following":[1,203],"source":[2],"coding":[3,181],"problem":[4],"was":[5,131],"introduced":[6,141],"by":[7,133,256],"Birk":[8],"and":[9,24,57,137,176,199,211,239,271,286],"Kol:":[10],"a":[11,14,28,72,142,241,248],"sender":[12],"holds":[13],"word":[15,125,174,249],"x":[16,52,93,114],"isin":[17],"{0,":[18],"1}":[19],"<sup":[20,236],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[21,35,40,47,54,87,95,116,147,237],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[22],",":[23,56,118],"wishes":[25],"to":[26,30,71,111],"broadcast":[27],"codeword":[29],"n":[31,67,77,235],"receivers,":[32],"R":[33,38,45,85],"<sub":[34,39,46,53,86,94,115,146],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sub>":[36,41],",...,":[37],".":[42,97],"receiver":[44],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i</sub>":[48,55,88,117],"is":[49,82,103,182,216,254],"interested":[50],"in":[51,166,183,201,280],"has":[58,247],"prior":[59],"side":[60,121],"information":[61],"comprising":[62],"some":[63],"subset":[64],"of":[65,127,155,195,231,251,264,269,291],"the":[66,91,153,172,192,202,265,292],"bits.":[68],"This":[69,253],"corresponds":[70],"directed":[73],"graph":[74,143,219,293],"G":[75,102,220,228,246],"on":[76],"vertices,":[78],"where":[79],"i":[80],"j":[81],"an":[83,104,128,156,217,257],"edge":[84],"Ri":[89,110],"knows":[90],"bit":[92],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">j</sub>":[96],"An":[98],"index":[99,129,159,180,225,243,278],"code":[100,130,160,226,244],"for":[101,161,206,227,245],"encoding":[105],"scheme":[106],"which":[107,150,260],"enables":[108],"each":[109],"always":[112,185],"reconstruct":[113],"given":[119],"his":[120],"information.":[122],"minimal":[124],"length":[126,154,232,250],"studied":[132],"Bar-Yossef,":[134,196],"Birk,":[135,197],"Jayram,":[136,198],"Kol":[138,200],"(FOCS'06).":[139],"They":[140,163],"parameter,":[144],"minrk":[145],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[148],"(G),":[149],"completely":[151],"characterizes":[152],"optimal":[157,173,277],"linear":[158,169,179,224],"G.":[162],"showed":[164],"that":[165,178,222],"various":[167],"cases":[168],"codes":[170,279],"attain":[171],"length,":[175],"conjectured":[177],"fact":[184],"optimal.":[186],"In":[187,273],"this":[188],"work,":[189],"we":[190,275],"disprove":[191],"main":[193],"conjecture":[194],"strong":[204],"sense:":[205],"any":[207],"epsiv":[208],">":[209],"0":[210],"sufficiently":[212],"large":[213],"n,":[214],"there":[215],"n-vertex":[218],"so":[221],"every":[223],"requires":[229],"codewords":[230],"at":[233],"least":[234],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">epsiv</sup>":[238],"yet":[240],"nonlinear":[242],"ne.":[252],"achieved":[255],"explicit":[258],"construction,":[259],"extends":[261],"Alon's":[262],"variant":[263],"celebrated":[266],"Ramsey":[267],"construction":[268],"Frankl":[270],"Wilson.":[272],"addition,":[274],"study":[276],"various,":[281],"less":[282],"restricted,":[283],"natural":[284],"models,":[285],"prove":[287],"several":[288],"related":[289],"properties":[290],"parameter":[294],"minrk(G).":[295]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":17},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":18},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":14}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
