A Polynomial-Time Algorithm for Pliable Index Coding

In pliable index coding, we consider a server with <inline-formula> <tex-math notation="LaTeX">m </tex-math></inline-formula> messages and <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> clients, where eac...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 64; no. 2; pp. 979 - 999
Main Authors:	Song, Linqi, Fragouli, Christina
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.02.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">t -requests Algorithm design and analysis Algorithms Coding Decoding Encoding greedy algorithm index coding Indexes Lower bounds Messages Pliable index coding polynomial time algorithm Polynomials Probabilistic analysis random graphs Servers Set theory Silicon Upper bound
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!