Filters








703 Hits in 6.1 sec

A Polynomial-Time Algorithm for Pliable Index Coding [article]

Linqi Song, Christina Fragouli
2017 arXiv   pre-print
We construct lower bound instances that require at least Ω((n)) transmissions for linear pliable index coding and at least Ω(t+(n)) transmissions for the t-requests case, indicating that both our upper  ...  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  ...  BINARY FIELD GREEDY ALGORITHM FOR t-REQUESTS CASE A straightforward method to solve the t-requests case is by repeatedly solving pliable index coding instances t times, resulting in an upper bound O(t  ... 
arXiv:1610.06845v2 fatcat:p2kavy7cgrb7hhqgmzhua54pna

A Pliable Index Coding Approach to Data Shuffling [article]

Linqi Song, Christina Fragouli, Tianchu Zhao
2018 arXiv   pre-print
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  ...  interleaved versions of requests that lead to the smallest number of transmissions. We prove that the constrained pliable index coding problem is NP-hard.  ... 
arXiv:1701.05540v3 fatcat:4w57oqnkdjbhde5wn2dehgorba

Pliable Index Coding via Conflict-Free Colorings of Hypergraphs [article]

Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram
2021 arXiv   pre-print
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  ...  For the scalar case, using the correspondence with conflict-free coloring, we show the existence of an achievable scheme which has length O(log^2Γ), where Γ refers to a parameter of the hypergraph that  ...  Other extensions of PICOD such as vector pliable index codes [7] , multiple requests [6] , [7] , secure pliable index codes [12] and decentralized pliable index codes [13] have also been studied  ... 
arXiv:2102.02182v2 fatcat:ofmg4oknsvbkte52jtooyhov7i

Tight Information Theoretic Converse Results for some Pliable Index Coding Problems [article]

Tang Liu, Daniela Tuninetti
2018 arXiv   pre-print
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).  ...  One of the open questions is to quantify the optimal code length is the non-pliable cases for the complete-S PICODptq, where the problem reduces to a distributed index coding problem [10] .  ... 
arXiv:1810.02451v2 fatcat:op3vlzfcondtbewb2brkqtaqhy

Optimal-Rate Characterisation for Pliable Index Coding using Absent Receivers

Lawrence Ong, Badri N. Vellambi, Jorg Kliewer
2019 2019 IEEE International Symposium on Information Theory (ISIT)  
We characterise the optimal broadcast rate for a few classes of pliable-index-coding problems.  ...  We show that for a certain class, the set of receivers is critical in the sense that adding any receiver strictly increases the broadcast rate.  ...  The aim of the pliable-index-coding lems Pm,U,D for all D.  ... 
doi:10.1109/isit.2019.8849527 dblp:conf/isit/OngVK19 fatcat:jltfwqdf65ee3cq3vjogfpqjvm

Content-type coding [article]

Linqi Song, Christina Fragouli
2015 arXiv   pre-print
The paper asks a novel question: if there are benefits in designing network and channel codes specifically tailored to content-type requests.  ...  This paper is motivated by the observation that, in many cases, we do not need to serve specific messages, but rather, any message within a content-type.  ...  The work in [7] [8] has shown that, although in the worst case, for index coding, we may require O(n) transmissions, for pliable index coding we require at most O(log 2 n), i.e., we can be exponentially  ... 
arXiv:1505.03561v2 fatcat:wu6ogstevfbgrkz2qxdulhrr7a

Index Coding with Multiple Interpretations

Valéria G. Pedrosa, Max H. M. Costa
2022 Entropy  
This work establishes a connection between index coding and error-correcting codes with multiple interpretations from the tree construction of nested cyclic codes.  ...  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 following is a proposal for pliable index coding with multiple interpretations.  ... 
doi:10.3390/e24081149 pmid:36010813 pmcid:PMC9407184 fatcat:lrsloutgavabfb2jay3hwxr7eu

Blind Index Coding [article]

David T.H. Kao, Mohammad Ali Maddah-Ali, A. Salman Avestimehr
2015 arXiv   pre-print
We introduce the blind index coding (BIC) problem, in which a single sender communicates distinct messages to multiple users over a shared channel.  ...  However, unlike classic index coding, in BIC, the sender is uncertain of what side information is available to each user.  ...  The research of A.S. Avestimehr and D.T.H.  ... 
arXiv:1504.06018v3 fatcat:urklm6sj5nagngle3zf2bfgpxe

Private Index Coding [article]

Varun Narayanan, Jithin Ravi, Vivek K. Mishra, Bikash Kumar Dey, Nikhil Karamchandani, Vinod M. Prabhakaran
2020 arXiv   pre-print
We call this the private index coding problem. We begin by characterizing the key access structures that make private index coding feasible.  ...  The outer bounds used in the case of three users are extended to arbitrary number of users and seen as a generalized version of the well-known polymatroidal bounds for the standard non-private index coding  ...  Recently, some works [22] , [23] , [25] studied the notion of weak privacy for a variant of the index coding problem called the Pliable Index CODing (PICOD(t)) introduced by Brahma et al.  ... 
arXiv:2006.00257v1 fatcat:e2kdqlk4nrhyndxnaoi3mihak4

Joint Index Coding and Incentive Design for Selfish Clients [article]

Yu-Pin Hsu, I-Hong Hou, Alex Sprintson
2020 arXiv   pre-print
The index coding problem includes a server, a group of clients, and a set of data chunks.  ...  In this paper, we investigate the index coding setting from a game-theoretical perspective.  ...  In addition to the original index coding problem, some variants of the index coding problem have also been investigated, such as the pliable index coding problem (e.g., [10] ) and the secure index coding  ... 
arXiv:2005.08545v4 fatcat:gtivxf4nabf65juotsy7a5vgj4

Load-Balanced Fractional Repetition Codes [article]

Alexandra Porter, Shashwat Silas, Mary Wootters
2019 arXiv   pre-print
LBFR codes have the additional property that multiple node failures can be sequentially repaired by downloading no more than one block from any other node.  ...  This allows for better use of the network, and can additionally reduce the number of disk reads necessary to repair multiple nodes.  ...  Consider the problem of greedily repairing multiple failed nodes in a system.  ... 
arXiv:1802.00872v2 fatcat:aaf26geibndnxgy2ckaabllnju

A Survey of Coded Distributed Computing [article]

Jer Shyuan Ng, Wei Yang Bryan Lim, Nguyen Cong Luong, Zehui Xiong, Alia Asheralieva, Dusit Niyato, Cyril Leung, Chunyan Miao
2020 arXiv   pre-print
To address these issues, coded distributed computing (CDC), i.e., a combination of coding theoretic techniques and distributed computing, has been recently proposed as a promising solution.  ...  Coding theoretic techniques have proved effective in WiFi and cellular systems to deal with channel noise.  ...  statistical properties Homogeneous [118] Pliable Index Coding Semi-random data shuffling scheme based on modified pliable index coding to reduce the number of commu- nication rounds Homogeneous  ... 
arXiv:2008.09048v1 fatcat:riy4dxvuc5ae3krz7lf25zkg6m

Generalized RDP Code Based Concurrent Repair Scheme in Cloud Storage Nodes

Guojun Xie, Jiquan Shen, Huanhuan Yang
2019 Information  
Aiming at the problem of large delay and low availability incurred by multiple invalid nodes in cloud storage, a new type of concurrent nodes repair scheme called Distributed-Cross Repair Solution (DCRS  ...  At the same time, the repair trigger mechanism is adopted in order to avoid the repair failure problem caused by the coming of additional damaged nodes during the system reparation, which increases the  ...  pliable FR codes, and provided a relatively comprehensive analysis of it.  ... 
doi:10.3390/info10010020 fatcat:htwsazoffvel5eahfjbs7tlwdq

Do Small Code Changes Merge Faster? A Multi-Language Empirical Investigation [article]

Gunnar Kudrjavets
2022 arXiv   pre-print
Pull request data from two other platforms: Gerrit and Phabricator (401,790 code reviews) confirms the lack of relationship.  ...  This study investigates the practicality of improving code velocity by optimizing pull request size and composition (ratio of insertions, deletions, and modifications).  ...  In the case of differences in distribution, we investigate whether it influences the relations of pull request size and composition to time-to-merge.  ... 
arXiv:2203.05045v1 fatcat:efdx4qvca5afnfot765gx5tjwq

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications

Ahmed Douik, Sameh Sorour, Tareq Y. Al-Naffouri, Mohamed-Slim Alouini
2017 IEEE Communications Surveys and Tutorials  
Index Terms-Strict and generalized instantly decodable network coding, completion time, decoding delay, graph theory, maximum weight clique problem, distributed optimization, device-todevice, cooperative  ...  The second part considers the use of instantly decodable codes in a device-to-device communication network, in which devices speed up the recovery of the missing packets by exchanging network coded packets  ...  ACKNOWLEDGEMENT The authors wish to thank Professor Parastoo Sadeghi for her helpful comments and suggestions.  ... 
doi:10.1109/comst.2017.2665587 fatcat:mobyvizrd5exhgovnvsbfb667a
« Previous Showing results 1 — 15 out of 703 results