On Pliable Index Coding

Sasi, Shanuja; Rajan, B. Sundar

doi:10.48550/arxiv.1901.05809

Cited by 3 publications

(14 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The secure IC problem was first proposed in [7], where private one-time-pad keys were used to meet the security demand. A weaker definition of security which can be achieved without security keys has also been discussed in [7] and has been extended to PICOD setting [8]. Achievable and converse bounds for the case of circular side information structure and linear encoding were derived in [5].…”

Section: Introductionmentioning

confidence: 99%

Optimal Linear Coding Schemes for the Secure Decentralized Pliable Index Coding Problem

Tuninetti

2020

Preprint

View full text Add to dashboard Cite

We study the secure decentralized Pliable Index CODing (PICOD) problem with circular side information sets at the users. The security constraint forbids every user to decode more than one message while decentralized setting means there is no central transmitter in the system. Compared to the secure but centralized version of the problem, a converse bound from one of our previous works showed a factor of three difference in optimal code length under the constraint of linear encoding. In this paper, we first list the linearly infeasible cases, that is, problems where no linear code can simultaneously achieve both correctness/decodability and security. 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.

show abstract

Section: Introductionmentioning

confidence: 99%

Optimal Linear Coding Schemes for the Secure Decentralized Pliable Index Coding Problem

Tuninetti

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…Recently, in [8], the Authors extended the private IC problem in [7] to the PICOD framework. Only the case where the side information structure is "circular", and where each user can decode one and only one message was considered in [8].…”

Section: Introductionmentioning

confidence: 99%

“…The first condition is a special case of the "circular-arc network topology hypergraph" class of PICOD studied in [6], for which an optimal solution was given without the privacy constraint. The second condition was first studied in [8] and was motivated by the need to keep content privacy is some distribution networks.This paper proposes both converse and achievable bounds. The proposed achievable scheme not only strictly outperforms the one in [8] for some values of the system parameters, but it is also information theoretically optimal in some settings.…”

mentioning

confidence: 99%

“…The second condition was first studied in [8] and was motivated by the need to keep content privacy is some distribution networks.This paper proposes both converse and achievable bounds. The proposed achievable scheme not only strictly outperforms the one in [8] for some values of the system parameters, but it is also information theoretically optimal in some settings. For the remaining cases, the proposed linear code is shown to require at most one more transmission than the converse bound derived by restricting the sender to only use linear codes.…”

mentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Private Pliable Index Coding

Tuninetti

2019

2019 IEEE Information Theory Workshop (ITW)

View full text Add to dashboard Cite

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. This paper studies the PICOD problem where users are subject to a privacy constraint. In particular, the following spacial class of private PICODs is investigated: 1) the side information structure is circular, and 2) each user can decode one and only one message. The first condition is a special case of the "circular-arc network topology hypergraph" class of PICOD studied in [6], for which an optimal solution was given without the privacy constraint. The second condition was first studied in [8] and was motivated by the need to keep content privacy is some distribution networks. This paper proposes both converse and achievable bounds. The proposed achievable scheme not only strictly outperforms the one in [8] for some values of the system parameters, but it is also information theoretically optimal in some settings. For the remaining cases, the proposed linear code is shown to require at most one more transmission than the converse bound derived by restricting the sender to only use linear codes.

show abstract

Index Coding with Multiple Interpretations

Pedrosa

Costa

2022

Entropy

View full text Add to dashboard Cite

The index coding problem consists of a system with a server and multiple receivers with different side information and demand sets, connected by a noiseless broadcast channel. The server knows the side information available to the receivers. The objective is to design an encoding scheme that enables all receivers to decode their demanded messages with a minimum number of transmissions, referred to as an index code length. The problem of finding the minimum length index code that enables all receivers to correct a specific number of errors has also been studied. This work establishes a connection between index coding and error-correcting codes with multiple interpretations from the tree construction of nested cyclic codes. The notion of multiple interpretations using nested codes is as follows: different data packets are independently encoded, and then combined by addition and transmitted as a single codeword, minimizing the number of channel uses and offering error protection. The resulting packet can be decoded and interpreted in different ways, increasing the error correction capability, depending on the amount of side information available at each receiver. Motivating applications are network downlink transmissions, information retrieval from datacenters, cache management, and sensor networks.

show abstract

On Pliable Index Coding

Abstract: A new variant of index coding problem termed as Pliable Index Coding Problem (PICOD) is formulated in [S.

Cited by 3 publications

References 3 publications

Optimal Linear Coding Schemes for the Secure Decentralized Pliable Index Coding Problem

Optimal Linear Coding Schemes for the Secure Decentralized Pliable Index Coding Problem

Private Pliable Index Coding

Index Coding with Multiple Interpretations

Contact Info

Product

Resources

About