Content-type coding

Song, Linqi; Fragouli, Christina

doi:10.1109/netcod.2015.7176784

Cited by 9 publications

(35 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Grouping Phase. Let us denote by W = w [1] the maximum weight of the messages. We divide the message vertices into log(n) + 1 groups, M 1 , M 2 , .…”

Section: A Algorithm Descriptionmentioning

confidence: 99%

“…For J ⊆ [1 (1) : m (1) 1 ] and |J| = 1, i.e., to satisfy the clients who miss only one Type-1 message, we need rank(A J∪[1 (2) :m (2) 2 ] ) = t. Since otherwise, for example if the only column j 1 ∈ [1 (1) : m…”

Section: B a Lower Bound For T-requests Casementioning

confidence: 99%

“…(2) For any column j ′ ∈ J (1) , the corresponding column vector is not in the linear space spanned by other column vectors of matrix A, i.e., a j ′ / ∈ span{a j |j ∈ [m]\{j ′ }}.…”

Section: A Lower Boundmentioning

confidence: 99%

“…Email: {songlinqi, christina.fragouli}@ucla.edu. This paper was presented in part at 2015 International Symposium on Network Coding (NetCod 2015) [1] and 2016 IEEE International Symposium on Information Theory (ISIT 2016) [2]. message she does not have.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A polynomial-time algorithm for pliable index coding

Song¹,

Fragouli²

2016

2016 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

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. We seek to minimize the number of broadcast transmissions, so that each client can recover any one unknown message she does not already have. Previous work has shown that the pliable index coding problem is NP-hard and requires at most O(log 2 (n)) broadcast transmissions, which indicates exponential savings over the conventional index coding that requires in the worst case O(n) transmissions. In this work, building on a decoding criterion that we propose, we first design a deterministic polynomial-time algorithm that can realize the exponential benefits, by achieving, in the worst case, a performance upper bounded by O(log 2 (n)) broadcast transmissions. We extend our algorithm to the t-requests case, where each client requires t unknown messages that she does not have, and show that our algorithm requires at most O(t log(n) + log 2 (n)) broadcast transmissions.We construct lower bound instances that require at least Ω(log(n)) transmissions for linear pliable index coding and at least Ω(t + log(n)) transmissions for the t-requests case, indicating that both our upper and lower bounds are polynomials of log(n) and differ within a factor of O(log(n)). Finally, we provide a probabilistic analysis and show that the required number of transmissions is almost surely Θ(log(n)), as compared to Θ(n/ log(n)) for index coding. Our numerical experiments show that our algorithm outperforms existing algorithms for pliable index coding by up to 50% less transmissions.

show abstract

“…Grouping Phase. Let us denote by W = w [1] the maximum weight of the messages. We divide the message vertices into log(n) + 1 groups, M 1 , M 2 , .…”

Section: A Algorithm Descriptionmentioning

confidence: 99%

Section: B a Lower Bound For T-requests Casementioning

confidence: 99%

Section: A Lower Boundmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A polynomial-time algorithm for pliable index coding

Song¹,

Fragouli²

2016

2016 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The general PICOD problem is not simpler than the IC problem in terms of complexity. For instance, the linear PICOD (here the sender is restricted to use linear codes) is still NPhard [9]. Some efficient algorithms to solve the general PICOD were proposed in [10].…”

Section: Introductionmentioning

confidence: 99%

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

Sparse and Low-Rank Optimization for Pliable Index Coding

Jiang

Shi

2018

2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)

View full text Add to dashboard Cite

Content-type coding

Cited by 9 publications

References 11 publications

A polynomial-time algorithm for pliable index coding

A polynomial-time algorithm for pliable index coding

Private Pliable Index Coding

Sparse and Low-Rank Optimization for Pliable Index Coding

Contact Info

Product

Resources

About