Linear Index Coding via Semidefinite Programming
نویسندگان
چکیده
منابع مشابه
Linear index coding via semidefinite programming
In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n bit word to n receivers (one bit per receiver), where the receivers have side information represented by a graph G. The objective is to minimize the length of a codeword sent to all receivers which allows each receiver to learn its bit. For linear index coding, the minimum possible length is k...
متن کاملIndex coding via linear programming
Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and efficient communication in wireless networks and in part by its connection to Network Coding. Optimal encoding schemes and efficient heuristics were studied in various settings, alongside leading to new results for Network Coding such as improved gaps between linear and n...
متن کاملA Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کاملStructural Design via Semidefinite Programming
We consider a general problem of Structural Design and demonstrate that under mild assumptions it can be posed as a Semidefinite program. The approach in question allows for unified treatment of single-load/multi-load Truss and Shape design with and without obstacles, same as for obstacle-free robust Truss and Shape design. We present three equivalent Semidefinite formulations of the Structural...
متن کاملProduct Theorems Via Semidefinite Programming
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lovász to determine the Shannon capacity of the pentagon; to show a direct sum theorem for non-deterministic communication complexity and direct product theorems for discrepancy; and in interactive proof systems to show parallel repetition theorems for res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2013
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548313000564