FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2180457036> ?p ?o ?g. }

• W2180457036 endingPage "6203" @default.
• W2180457036 startingPage "6192" @default.
• W2180457036 abstract "We formulate a new variant of the index coding problem, where instead of demanding a specific message, clients are pliable, and are interested in receiving any t messages that they do not have. We term this problem pliable index coding or PICOD(t). We prove that, with this formulation, although some instances of the problem become simple, in general, the problem of finding the optimal linear code remains NP-hard. However, we show that it is possible to construct pliable index codes that are substantially smaller than index codes in many cases. If there are n clients, the server has m messages, and each client has a side information set of cardinality s ≤ m - t; we show that O(min{t log n, t + log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> n}) broadcast transmissions are sufficient to satisfy all the clients. For t = 1, this is an exponential improvement over the n messages required in index coding in the worst case (for m = n). In addition, for t ≫ log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> n, the number of broadcast transmissions required is only linearly dependent on t. We generalize the results to instances where the side information sets are not necessarily of equal cardinality. When m = O(n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>δ</sup> ), for some constant δ > 0, we show that the codes of size O(min{t log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> n, t log n + log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>3</sup> n}) are sufficient in general. We also consider the scenario when the server only knows the cardinality of the side information sets of the clients and each client is interested in receiving any t messages that it does not have. We term this formulation oblivious pliable index coding or OB-PICOD(t). If the cardinalities of side information sets of all the clients is s (with s ≤ m - t), then we show that min{s + t, m - s} messages are both sufficient and necessary for linear codes. Finally, we develop efficient heuristic approximation algorithms for PICOD(t) and show through simulations on the random instances of PICOD(t) that they perform well in practice." @default.
• W2180457036 created "2016-06-24" @default.
• W2180457036 creator A5047714914 @default.
• W2180457036 creator A5056591688 @default.
• W2180457036 date "2015-11-01" @default.
• W2180457036 modified "2023-09-30" @default.
• W2180457036 title "Pliable Index Coding" @default.
• W2180457036 cites W1586341635 @default.
• W2180457036 cites W1966169258 @default.
• W2180457036 cites W1973643917 @default.
• W2180457036 cites W1992260716 @default.
• W2180457036 cites W2010213837 @default.
• W2180457036 cites W2012559125 @default.
• W2180457036 cites W2013945717 @default.
• W2180457036 cites W2039915451 @default.
• W2180457036 cites W2056125869 @default.
• W2180457036 cites W2064269488 @default.
• W2180457036 cites W2081008934 @default.
• W2180457036 cites W2111425915 @default.
• W2180457036 cites W2111851330 @default.
• W2180457036 cites W2116471929 @default.
• W2180457036 cites W2123051422 @default.
• W2180457036 cites W2130507035 @default.
• W2180457036 cites W2140832808 @default.
• W2180457036 cites W2147634561 @default.
• W2180457036 cites W2161866053 @default.
• W2180457036 cites W2165579188 @default.
• W2180457036 cites W2166566648 @default.
• W2180457036 cites W2166785860 @default.
• W2180457036 cites W2171844485 @default.
• W2180457036 cites W2977322974 @default.
• W2180457036 doi "https://doi.org/10.1109/tit.2015.2477821" @default.
• W2180457036 hasPublicationYear "2015" @default.
• W2180457036 type Work @default.
• W2180457036 sameAs 2180457036 @default.
• W2180457036 citedByCount "49" @default.
• W2180457036 countsByYear W21804570362015 @default.
• W2180457036 countsByYear W21804570362016 @default.
• W2180457036 countsByYear W21804570362017 @default.
• W2180457036 countsByYear W21804570362018 @default.
• W2180457036 countsByYear W21804570362019 @default.
• W2180457036 countsByYear W21804570362020 @default.
• W2180457036 countsByYear W21804570362021 @default.
• W2180457036 countsByYear W21804570362022 @default.
• W2180457036 countsByYear W21804570362023 @default.
• W2180457036 crossrefType "journal-article" @default.
• W2180457036 hasAuthorship W2180457036A5047714914 @default.
• W2180457036 hasAuthorship W2180457036A5056591688 @default.
• W2180457036 hasConcept C105795698 @default.
• W2180457036 hasConcept C11413529 @default.
• W2180457036 hasConcept C114614502 @default.
• W2180457036 hasConcept C118615104 @default.
• W2180457036 hasConcept C124101348 @default.
• W2180457036 hasConcept C136764020 @default.
• W2180457036 hasConcept C179518139 @default.
• W2180457036 hasConcept C2777382242 @default.
• W2180457036 hasConcept C33923547 @default.
• W2180457036 hasConcept C41008148 @default.
• W2180457036 hasConcept C80444323 @default.
• W2180457036 hasConcept C87117476 @default.
• W2180457036 hasConceptScore W2180457036C105795698 @default.
• W2180457036 hasConceptScore W2180457036C11413529 @default.
• W2180457036 hasConceptScore W2180457036C114614502 @default.
• W2180457036 hasConceptScore W2180457036C118615104 @default.
• W2180457036 hasConceptScore W2180457036C124101348 @default.
• W2180457036 hasConceptScore W2180457036C136764020 @default.
• W2180457036 hasConceptScore W2180457036C179518139 @default.
• W2180457036 hasConceptScore W2180457036C2777382242 @default.
• W2180457036 hasConceptScore W2180457036C33923547 @default.
• W2180457036 hasConceptScore W2180457036C41008148 @default.
• W2180457036 hasConceptScore W2180457036C80444323 @default.
• W2180457036 hasConceptScore W2180457036C87117476 @default.
• W2180457036 hasIssue "11" @default.
• W2180457036 hasLocation W21804570361 @default.
• W2180457036 hasOpenAccess W2180457036 @default.
• W2180457036 hasPrimaryLocation W21804570361 @default.
• W2180457036 hasRelatedWork W1974360440 @default.
• W2180457036 hasRelatedWork W1978042415 @default.
• W2180457036 hasRelatedWork W1981646468 @default.
• W2180457036 hasRelatedWork W2022182753 @default.
• W2180457036 hasRelatedWork W2085151508 @default.
• W2180457036 hasRelatedWork W2157535554 @default.
• W2180457036 hasRelatedWork W2276139133 @default.
• W2180457036 hasRelatedWork W2596944507 @default.
• W2180457036 hasRelatedWork W2612896625 @default.
• W2180457036 hasRelatedWork W2739495308 @default.
• W2180457036 hasVolume "61" @default.
• W2180457036 isParatext "false" @default.
• W2180457036 isRetracted "false" @default.
• W2180457036 magId "2180457036" @default.
• W2180457036 workType "article" @default.