A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Pliable Index Coding
2015
IEEE Transactions on Information Theory
Preserved Fulltext
We propose a new formulation of the index coding problem, where instead of demanding a specific message, clients are "pliable" and are happy to receive any one message they do not have. ...
coding requirements. ...
PICOD IS NP-HARD For given side information sets, the length of the optimal pliable index code cannot be worse than the length of the optimal index code. ...
doi:10.1109/tit.2015.2477821
fatcat:z52kytkygnenlp6sm2tq4frc7q
Pliable index coding
2012
2012 IEEE International Symposium on Information Theory Proceedings
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a new formulation of the index coding problem, where instead of demanding a specific message, clients are "pliable" and are happy to receive any one message they do not have. ...
coding requirements. ...
PICOD IS NP-HARD For given side information sets, the length of the optimal pliable index code cannot be worse than the length of the optimal index code. ...
doi:10.1109/isit.2012.6283912
dblp:conf/isit/BrahmaF12
fatcat:4jjgo5as6vfshezpeyzztiph44
Very Pliable Index Coding
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In the pliable variant of index coding, receivers are allowed to decode any new message not known a priori. ...
This paper proposes a formulation that further relaxes the decoding requirements of pliable index coding by allowing receivers to decode different new messages depending on message realisations. ...
, index codes and pliable index codes can be concatenated. ...
arXiv:2205.02614v1
fatcat:a566ajm66betzelz4g4aknyt3y
On Pliable Index Coding
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A new variant of index coding problem termed as Pliable Index Coding Problem (PICOD) is formulated in [S. Brahma, C. ...
Another variant of index coding problem is - c-Constrained Pliable Index Coding Problem [Linqi Song, Christina Fragouli and Tianchu Zhao, "A Pliable Index Coding Approach to Data Shuffling," arXiv:1701.05540v3 ...
Another variant of index coding is Constrained Pliable Index Coding. In c-Constrained Pliable Index Coding, each message is decoded by atmost c clients who demand that message. ...
arXiv:1901.05809v1
fatcat:ri4dn6qdynfj7kq5beqfqfbb3q
Decentralized Pliable Index Coding
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper introduces the decentralized Pliable Index CODing (PICOD) problem: a variant of the Index Coding (IC) problem, where a central transmitter serves pliable users with message side information; ...
For the decentralized PICOD, sparse Maximum Distance Separable (MDS) codes and vector linear index codes are used (as opposed to scalar linear codes). ...
(iii) User u i knows the messages indexed by its side information set A i Ă rms, i P rns. ...
arXiv:1904.05272v1
fatcat:yjdevm6h7vh2fnbzmdhwpgdjhy
Private Pliable Index Coding
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The Pliable Index CODing (PICOD) problem is a variant of the Index Coding (IC) problem, where the desired messages by the users, who are equipped with message side information, is part of the optimization ...
Rajan, "On pliable index coding," arXiv:1901.05809] for some values of the system parameters, but it is also information theoretically optimal in some settings. ...
INTRODUCTION a) Pliable Index Coding (PICOD): PICOD is a variant of the Index Coding (IC) problem and was first introduced in [2] . ...
arXiv:1904.04468v3
fatcat:zpsyjmg4gvblre43qjaszzdw4a
Secure Decentralized Pliable Index Coding
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper studies a variant of the Pliable Index CODing (PICOD) problem, i.e., an index coding problem where a user can be satisfied by decoding any message that is not in its side information set, where ...
difficulty of the general version of this problem, this paper focuses on the case where the side information sets are 's circular shifts', namely, user u's side information set is the set of messages indexed ...
In this paper we study the decentralized, secure and pliable IC problem, which is motivated by three variants of IC: Pliable Index CODing (PICOD), decentralized IC, and secure IC. a) Pliability: The PICOD ...
arXiv:2001.03810v1
fatcat:yvjns3jgw5hr3amornccskvygm
A Pliable Index Coding Approach to Data Shuffling
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We theoretically analyze pliable index coding under data shuffling constraints, and design a hierarchical data-shuffling scheme that uses pliable coding as a component. ...
In this paper, we posit that pliable index coding can offer a more efficient framework for data shuffling, as it can better leverage the many possible shuffling choices to reduce the number of transmissions ...
Constrained Pliable Index Coding is NP-hard It suffices to show that 1-constrained pliable index coding is NP-hard. Theorem 1. ...
arXiv:1701.05540v3
fatcat:4w57oqnkdjbhde5wn2dehgorba
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In the pliable index coding (PICOD) problem, a server is to serve multiple clients, each of which possesses a unique subset of the complete message set as side information and requests a new message which ...
Our codes are of near-optimal length (up to a multiplicative factor of log t). ...
Other extensions of PICOD such as vector pliable index codes [2] , multiple requests [1] , [2] , secure pliable index codes [12] and decentralized pliable index codes [13] have been studied recently ...
arXiv:2102.02182v3
fatcat:666jvkohavb67g4mzibfenzwh4
A Polynomial-Time Algorithm for Pliable Index Coding
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Previous work has shown that the pliable index coding problem is NP-hard and requires at most O(^2(n)) broadcast transmissions, which indicates exponential savings over the conventional index coding that ...
In pliable index coding, we consider a server with m messages and n clients where each client has as side information a subset of the messages. ...
This means that vector pliable index coding cannot do worst than scalar pliable index coding. An interesting question is the lower bounds. ...
arXiv:1610.06845v2
fatcat:p2kavy7cgrb7hhqgmzhua54pna
A Deterministic Algorithm for Pliable Index Coding
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Pliable index coding considers a server with m messages, and n clients where each has as side information a subset of the messages. ...
We also establish a connection between the pliable index coding problem and the minrank problem over a family of mixed matrices. ...
To design this algorithm, we leverage an algebraic criterion for pliable index coding we have derived in [9] . ...
arXiv:1601.05516v1
fatcat:6prh376sonhjnm4omlmmdaac34
Tight Information Theoretic Converse Results for some Pliable Index Coding Problems
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
This paper studies the Pliable Index CODing problem (PICOD), which models content-type distribution networks. ...
In the PICOD(t) problem there are m messages, n users and each user has a distinct message side information set, as in the classical Index Coding problem (IC). ...
In this paper, we study this variant of IC known as Pliable Index CODing (PICOD), firstly proposed in [4] . The PICODptq and the IC share many attributes. ...
arXiv:1810.02451v2
fatcat:op3vlzfcondtbewb2brkqtaqhy
Optimal Linear Coding Schemes for the Secure Decentralized Pliable Index Coding Problem
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We study the secure decentralized Pliable Index CODing (PICOD) problem with circular side information sets at the users. ...
Then, we propose linear coding schemes for all remaining cases and show that their attained code length is to within an additive constant gap from our converse bound. ...
INTRODUCTION In this paper we study the Secure Decentralized Pliable Index CODing (SD-PICOD) problem. ...
arXiv:2010.10494v1
fatcat:yh43vglpqvfzvedje2swysolli
Improved Lower Bounds for Pliable Index Coding using Absent Receivers
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1909.11850v1 fatcat:fhf2brug5rgz7pe3266deeulzm
This paper studies pliable index coding, in which a sender broadcasts information to multiple receivers through a shared broadcast medium, and the receivers each have some message a priori and want any ...
A pliable index coding problem is thus defined uniquely by m and the set U Given a pliable-index-coding problem with m messages and present receivers U, a pliable index code of length ∈ Z + consists of ...
As with original index-coding problems, the optimal broadcast rate is not known for pliable-index-coding problems in general. ...
arXiv:1909.11850v2
fatcat:g4su4edwpvgcteh735x4x3igbq
Bounding the Optimal Length of Pliable Index Coding via a Hypergraph-based Approach
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In pliable index coding (PICOD), a number of clients are connected via a noise-free broadcast channel to a server which has a list of messages. ...
SYSTEM MODEL FOR PICOD AND HYPERGRAPH REPRESENTATION We recall the system model of pliable index coding from [1] . ...
The goal of pliable index coding is to design PICOD schemes that have length as small as possible, while satisfying all clients. ...
arXiv:2208.10389v2
fatcat:5qagiewngrcazhxsf7zcdijy34
« Previous
Showing results 1 — 15 out of 2,049 results