Index Coding Algorithms for Constructing Network Codes. Salim El Rouayheb. Illinois Institute of Technology, Chicago
|
|
- Naomi Ward
- 5 years ago
- Views:
Transcription
1 Index Coding Algorithms for Constructing Network Codes Salim El Rouayheb Illinois Institute of Technology, Chicago
2 Matlab Code with GUI for Constructing Linear Network Codes Matlab outputs network code GUI Download Matlab code here:
3 X1 s1 X2 s2 e2 e6 X1 X2 has e3 e1 e5 e1 e4 e4 e2 e6 e7 t2 t1 Wants: X2 X1 Network Coding Problem 1 e7 e5 e3 Index Coding Problem Index Code
4 Example 2 X 1 s 1 s 2 X 2 s 3 X 3 e 2 e 3 e 5 e 7 e 8 e 9 e 1 e 10 e 4 e 6 e 11 e 13 e 14 e 15 e 16 e 12 e 17 e 18 e 19 Wants: t 3 t 2 t 1 X 3 X 2 X 1
5 Non-linear code [Dougherty, Freiling, Zeger, 05]
6 Locally Repairable Code X 2 X 3 node 3 X 4 node 4 X 5 Constructing Linear Repairable Codes* is equivalent to constructing linear index codes [Mazumdar 14],[Shanmugam, Dimakis 14] node 2 node 5 X 1 node 1
7 Locally Repairable Code X 3 node 3 X 4 node 4 X 2 node 2 X 5 node 5 X 1 node 1 X 3 = X X 4 X 4 =0.5639X X 5 X 3 = 2 X 4 = node 3 node 4 node 3 node 4 X 2 =0.5859X X 3 X 5 =1.0807X X 4 X 2 = X 5 = node 2 node 5 node 2 node 5 node 1 X 1 =0.4708X X 5 X 1 = 1 node 1
8 Matroids and Index Coding Fano matroid Linear representation over GF(2) (does not exist over GF(3)) Theorem: [R,Sprintson, Georghiades 09] For any matroid M(E, r(.)), one can construct an index coding problem and an integer c= E +r(e) such that there exists a linear index code of length c over F, iff the matroid M has a representation over F.
9 Matlab Code Available Online
10 X 1 s 1 s 2 X 2 Part II e 6 X 1 X 2 e 2 e 3 e 1 e 1 e 5 e 4 e 2 e 4 e 6 e 7 t 2 Wants: X 2 t 1 X 1 Network Coding Problem e 7 e 5 e 3 Index Coding Problem Index Code
11 Distributed Index Coding Storage Wants: X 1 Has: X 2 X 3 t 1 Transmission # Index code 1 Index code2 1 X 1 X 1 +X 2 t 4 t 2 2 X 2 X 3 3 X 3 X 4 Wants: X 4 Has: X 1 X 1 X 2 X 3 X 4 Wants: X 2 Has: X 1 X 3 4 X 4 Wants: X 3 Has: X 2 X 4 t 3 L=4" L=3" Informed-source coding-on-demand [Birk & Kol infocom 98]
12 Equivalence to Network Coding L Terminals: t 4 t 1 t 2 t 3 Wants: X 4 X 1 X 2 X 3 An index code of length L that satisfies all the users A network code that satisfies all the terminals
13 Stating the Equivalence Theorem: [R,Sprintson, Georghiades 08] [Effros,R,Langberg ISIT 13] For any network coding problem, one can construct an index coding problem and an integer L such that given any linear network code, one can efficiently construct a linear index code of length L, and vice versa. (same block length, same error probability). How to map the codes? X 1, X 2,, X r How many? Rates? Wants:??? Has:???
14 Network Code è Index Code The linear case first X 1 X 2 X 1 X 2 X 1 +X 2 X 1 X 2 X X 1 +X 1 +X 2 2 Butterfly network Y e1 +X 1 Y e2 +X 1 Y e3 +X 2 Y e4 +X 2 Y e5 +X 1 +X 2 Y e6 +X 1 +X 2 Y e7 +X 1 +X 2 X 1, X 2 Y e1, Y e2,, Y e7 H(Y ei )=c(e i )=1 Equivalent index code All terminals in the index coding problem can decode Any linear network code gives an index code of length L=7
15 Index Code è Network Code Given a linear index code Y e1 +X 1 Y e2 +X 1 Y e3 +X 2 Y e4 +X 2 Y e5 +X 1 +X 2 Y e6 +X 1 +X 2 Y e7 +X 1 +X 2 Can always diagonalize Y e1 +Y e2 Y e2 +X 1 Y e3 +X 2 Y e4 +X 2 Y e5 +Y e4 +X 1 Y e6 +X 1 +X 2 Y e6 +Y e7 Butterfly network Any linear index code of length L=7 can be mapped to a linear network code Works for scalar linear and vector linear
16 Non-Linear Network Code è Index Code EASY Y e1 + f e1 (X 1,X 2 ) Y e2 + f e2 (X 1,X 2 ) Y e3 + f e3 (X 1,X 2 ) Y e4 + f e4 (X 1,X 2 ) Y e5 + f e5 (X 1,X 2 ) Y e6 + f e6 (X 1,X 2 ) Y e7 + f e7 (X 1,X 2 ) Butterfly network Equivalent index code f ei (X 1,X 2 ) : message on edge e i
17 Implications: Scalar vs. Vector Linear Scalar linear index codes are not optimal [Dougherty, Freiling, Zeger, 05]
18 Non-linear Index Codes -> Network Codes HARD!!! Butterfly network B 0 1 = g 0 1(Y e1, X) B 0 2 = g 0 2(Y e2, X) B 0 3 = g 0 3(Y e3, X) B 0 4 = g 0 4(Y e4, X) B 0 5 = g 0 5(Y e5, X) B 0 6 = g 0 6(Y e6, X) B 0 7 = g 0 7(Y e7, X) Cannot always Diagonalize Given a nonlinear index code B 1 = g 1 (Ȳe, X) B 2 = g 2 (Ȳe, X) B 3 = g 3 (Ȳe, X) B 4 = g 4 (Ȳe, X) B 5 = g 5 (Ȳe, X) B 6 = g 6 (Ȳe, X) B 7 = g 7 (Ȳe, X)
19 Non-linear Index Code è Network Code Broadcast message Decoding function D Ue2 (0,X 1 ) D Ue3 (0,X 2 ) D Ue1 (0,X 1 ) D Ue4 (0,X 2 ) D Ue5 (0,Y e2,y e3 ) X1 =D Ut1 (B,Y e4,y e7 ) Y e4 = D Ue4 (B,X 2 ) Y e7 = D Ue7 (B,Y e5 ) D Ue7 (0,Y e5 ) D Ue6 (0,Y e5 ) Fix a value for B, say B=0 Destinations can decode with no errors: Recall that B=f(X 1,X 2, Y e1,,y e7 ) For a fixed B and given values of X 1 and X 2, there is a unique possible vector (Y e1,,y e7 ) Otherwise, U* cannot decode correctly
20 X 1 s 1 s 2 X 2 Part III e 6 X 1 X 2 e 2 e 3 e 1 e 1 e 5 e 4 e 2 e 4 e 6 e 7 t 2 Wants: X 2 t 1 X 1 Network Coding Problem e 7 e 5 e 3 Index Coding Problem Index Code
21 Distributed Index Coding Storage Wants: X 1 Has: X 2 X 3 t 1 Transmission # Index code 1 Index code2 1 X 1 X 1 +X 2 t 4 t 2 2 X 2 X 3 3 X 3 X 4 Wants: X 4 Has: X 1 X 1 X 2 X 3 X 4 Wants: X 2 Has: X 1 X 3 4 X 4 Wants: X 3 Has: X 2 X 4 t 3 L=4" L=3" Informed-source coding-on-demand [Birk & Kol infocom 98]
22 Index Coding & Graph Coloring user 1 has packet X 1 +X Side info graph G d X X 4 Clique cover of G = Chromatic nbr of Ḡ X 1 +X 2 +X 3 +X G 5 X 5 Ḡ 5
23 Index Coding & Graph Coloring 1 2 X 1 +X X X 4 Side info graph G d Independence nbr (G) apple c(g) apple L min apple d f d Chromatic nbr of (Ḡ) apple (Ḡ) Ḡ Shannon capacity [Haemers 79 ] Fractional Chromatic nbr [Blasiak et al. 11 ] [ Alon et al., 08] [Maleki, Cadambe, Jafar 12] apple f`(g) Fractional local chrom. nbr [Shanmugan et al. 13] [Arbabjolfaei et al., 13]
24 Index Coding on Erdős-Rényi Graphs Independence nbr (G) apple L min apple (Ḡ) When n!1, we have with prob 1 log n apple L min apple n log n Can improve the lower bound [Haviv & Langberg 11 ] c p n apple L min apple Chromatic nbr n log n G(n,p) Coloring is the best upper bound we know on random graphs. Is it tight? OPEN
25 Index Coding & Rank Minimization t 1 t 2 t 3 t 4 X 1 X 2 X 3 X 4 1 * * 0 * 1 * 0 0 * 1 * * Linear case: Computing L min =minrk(m) L min Matrix M [Bar-Yossef et al. '06] Min rank introduced by Haemers in 79 to bound the Shannon graph capacity. is NP hard. [R. et al. '07] [Peeters 96] Recent work on matrix completion for index coding [Hassibi et al. 14]
26 Use Matrix Completion Methods to Construct Index Codes Min nuclear norm [Recht & Candes 09] does not work here Try alternative rank minimization methods [Fazel et al ] C D Index coding via AP Two problems: 1) Regions not convex 2) Optimization over the reals Network codes over the reals [Shwartz & Medard 14], Jaggi et al. 08] Theorem: [Alternating Projections (AP)] If C and D are convex, then an alternating projection sequence between these 2 regions converges to a point in their intersection.
27
28 Index Coding via Alternating Proj on Random Undirected Graphs n=100 users
29 Performance with Increasing Number of Users
30 Improvement in Percentage
31 Concentration around the Average
32 Running Time s/graph n: number of users (p=0.2)
33 Random Directed Graphs
34 Which Method to use for Directed Graphs?
35 How close are these heuristics to the actual minimum For n 5, linear index coding achieve capacity [Ong, 14]. Online list of optimal index coding rates [kim] APindex coding was able to achieve all these rates whenever they are integers
36 Concluding Remarks Index coding is NP hard. But, this is not the end of the story. Proposed the use of different rank minimizations methods for constructing index codes Index coding is connected to many other interesting topic in the literature Many theoretical open questions: From reals to finite fields? theoretical guarantees? Index coding on random graphs? Need a stronger equivalence for equivalence of capacity regions. To do list for the matlab library Vector linear network codes Now only multiple unicast Include more methods (heuristics) for index coding: Now only LDG and minrank Network desgin
37 QUESTIONS?
38 Dealing with Errors Consider an index code where decoding errors only happen when the broadcast message B=0 ε: Prob of error in the index code =1/2 c =1/2 7 = Prob of error in the network code =1 (bad). Claim: There exists σ, such that for B=σ, in the previous construction, the network code will have a prob of error at most ε (ε=error prob of the index code). Intuition: if for every value of B, the resulting network code will have a prob of error>ε, this implies that the prob of error in the index code >ε. A contradiction. B X=(X 1,X 2 ) Ye= Σ X =2 2 D U (B,X 1,X 2 ) : decoding error Each corresponds to a different good value of (X,Ye) Σ B =2 c Total # of <(1-ε) Σ B. Σ X But Σ B = Σ Ye è Total # of good values<(1-ε) Σ Ye. Σ X contradiction
39 Capacity Regions R X2 R B R B =7 1 P P H R N 1 R X1 :Capacity region of a network R X1 1 1 R X2 R I :Capacity region of the equivalent index code If there is a code that achieves P exactly, then P is in R I \ H, and vice versa. What if a sequence of points (not necessarily in H) converges to P. Does this mean that P is in R N? If true this will solve a long-standing open problem: Is zero-error capacity= ε-error capacity of networks? True for index coding problems [Langberg, Effros 11]
40 The Case of Co-located Sources R X2 R B R B =7 1 P P H R N 1 R X1 :Capacity region of a network 1 1 R X2 R I :Capacity region of the equivalent index code Theorem: For any network N with co-located sources one can efficiently construct an index coding problem I and an integer L such that R is in the capacity region of N iff R is in the capacity region of with broadcast length L. I
41
42 Information Flows in Wireline Networks: What do we know in one slide Source S S cut S 1 S 2 S n Network Network Network Terminal t t 1 t n t 2 t 3 t 1 t n t 2 t 3 Unicast networks Max Flow Min Cut theorem [Ford & Fulkerson, 56] [Elias, Feinstein, Shannon 56] Multicast networks Network coding can achieve min mincut [Ahlswede et al. 00] General Demands Open! Non-linear codes, Non- Shannon inequalities [Zeger et al. 06] Two-unicast is as hard. [Kamath, Tse, Wang 14]
43
Index Coding & Caching in Wireless Networks. Salim El Rouayheb. ECE IIT, Chicago
Index Coding & Caching in Wireless Networks Salim El Rouayheb ECE IIT, Chicago Big Data vs. Wireless Exabytes per month [Cisco] Meanwhile, Storage is Getting Cheaper Storage cost per GB (USD) http://www.mkomo.com/cost-per-gigabyte-update
More informationAn Equivalence between Network Coding and Index Coding
An Equivalence between Network Coding and Index Coding Michelle Effros, Fellow, IEEE, Salim El Rouayheb, Member, IEEE, Michael Langberg, Member, IEEE 1 Abstract We show that the network coding and index
More informationOptimal Index Codes via a Duality between Index Coding and Network Coding
Optimal Index Codes via a Duality between Index Coding and Network Coding Ashok Choudhary, Vamsi Krishna Gummadi, Prasad Krishnan Signal Processing and Communications Research Centre, International Institute
More informationLocal Graph Coloring and Index Coding
1 Local Graph Coloring and Index Coding Karthikeyan Shanmugam, Alexandros G. Dimakis and Michael Langberg Department of Electrical and Computer Engineering University of Texas at Austin Austin, TX 78712-1684
More informationOn the Index Coding Problem and its Relation to Network Coding and Matroid Theory
1 On the Index Coding Problem and its Relation to Network Coding and Matroid Theory Salim Y. El Rouayheb, Alex Sprintson, and Costas N. Georghiades Department of Electrical and Computer Engineering Texas
More informationOptimal Index Codes with Near-Extreme Rates
0 IEEE International Symposium on Information Theory Proceedings Optimal Index Codes with Near-Extreme Rates Son Hoang Dau Division of Mathematical Sciences School of Phys. and Math. Sciences Nanyang Technological
More informationOn the Hardness of Approximating the Network Coding Capacity
On the Hardness of Approximating the Network Coding Capacity Michael Langberg, Member, IEEE, and Alex Sprintson, Member, IEEE. 1 Abstract This work addresses the computational complexity of achieving the
More informationIndex coding with side information
Index coding with side information Ehsan Ebrahimi Targhi University of Tartu Abstract. The Index Coding problem has attracted a considerable amount of attention in the recent years. The problem is motivated
More informationIndex Coding via Random Coding
204 Iran Workshop on Communication and Information Theory (IWCIT) Index Coding via Random Coding Fatemeh Arbabjolfaei,BerndBandemer,Young-HanKim Department of Electrical and Computer Engineering University
More information2014 IEEE International Symposium on Information Theory. Two-unicast is hard. David N.C. Tse
Two-unicast is hard Sudeep Kamath ECE Department, University of California, San Diego, CA, USA sukamath@ucsd.edu David N.C. Tse EECS Department, University of California, Berkeley, CA, USA dtse@eecs.berkeley.edu
More informationThe two-unicast problem
The two-unicast problem Sudeep Kamath, Venkat Anantharam, David Tse, Chih-Chun Wang ECE Department, Princeton University, sukamath@princeton.edu EECS Department, University of California, Berkeley, ananth@eecs.berkeley.edu
More informationOn linear index coding from graph homomorphism perspective
On linear index coding from graph homomorphism perspective Javad B. Ebrahimi, Mahdi Jafari Siavoshani Institute of Network Coding, Chinese University of Hong Kong, Hong Kong Computer Engineering Department,
More informationBroadcasting With Side Information
Department of Electrical and Computer Engineering Texas A&M Noga Alon, Avinatan Hasidim, Eyal Lubetzky, Uri Stav, Amit Weinstein, FOCS2008 Outline I shall avoid rigorous math and terminologies and be more
More informationIndex Coding With Erroneous Side Information
Index Coding With Erroneous Side Information Jae-Won Kim and Jong-Seon No, Fellow, IEEE 1 Abstract arxiv:1703.09361v1 [cs.it] 28 Mar 2017 In this paper, new index coding problems are studied, where each
More informationAnalyzing Large Communication Networks
Analyzing Large Communication Networks Shirin Jalali joint work with Michelle Effros and Tracey Ho Dec. 2015 1 The gap Fundamental questions: i. What is the best achievable performance? ii. How to communicate
More informationOptimal Scalar Linear Index Codes for Symmetric and Neighboring Side-information Problems
Optimal Scalar Linear Index Codes for Symmetric and Neighboring Side-information Problems Mahesh Babu Vaddi and B Sundar Rajan Department of Electrical Communication Engineering, Indian Institute of Science,
More informationIndex Coding. Trivandrum School on Communication, Coding and Networking Prasad Krishnan
Index Coding Trivandrum School on Communication, Coding and Networking 2017 Prasad Krishnan Signal Processing and Communications Research Centre, International Institute of Information Technology, Hyderabad
More informationLinear Index Codes are Optimal Up To Five Nodes
Linear Index Codes are Optimal Up To Five Nodes Lawrence Ong The University of Newcastle, Australia March 05 BIRS Workshop: Between Shannon and Hamming: Network Information Theory and Combinatorics Unicast
More informationScalar-linear Solvability of Matroidal Networks Associated with Representable Matroids
Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids Anthony Kim and Muriel Medard Research Laboratory of Electronics Massachusetts Institute of Technology Email: {tonyekim,
More informationOn the Capacity Region for Secure Index Coding
On the Capacity Region for Secure Index Coding Yuxin Liu, Badri N. Vellambi, Young-Han Kim, and Parastoo Sadeghi Research School of Engineering, Australian National University, {yuxin.liu, parastoo.sadeghi}@anu.edu.au
More informationA Novel Index Coding Scheme and its Application to Coded Caching
A ovel Index Coding Scheme and its Application to Coded Caching ai Wan Laboratoire des Signaux et Systèmes L2S CentraleSupèlec-CRS-Universitè Paris-Sud 91192 Gif-sur-Yvette, France Email: kai.wan@u-psud.fr
More informationSimplified Composite Coding for Index Coding
Simplified Composite Coding for Index Coding Yucheng Liu, Parastoo Sadeghi Research School of Engineering Australian National University {yucheng.liu, parastoo.sadeghi}@anu.edu.au Fatemeh Arbabjolfaei,
More informationRobust Network Codes for Unicast Connections: A Case Study
Robust Network Codes for Unicast Connections: A Case Study Salim Y. El Rouayheb, Alex Sprintson, and Costas Georghiades Department of Electrical and Computer Engineering Texas A&M University College Station,
More informationGeneralized Network Sharing Outer Bound and the Two-Unicast Problem
Generalized Network Sharing Outer Bound and the Two-Unicast Problem Sudeep U. Kamath, David N. C. Tse and Venkat Anantharam Wireless Foundations, Dept of EECS, University of California at Berkeley, Berkeley,
More informationNetworks and Matroids
Adaptive Signal Processing and Information Theory Research Group ECE Department, Drexel University June 1, 2012 Outline 1 Mappings and Definitions Source Mapping: S : V 2 µ, µ is message set. Message Assignment:
More informationOn the Relation Between the Index Coding and the Network Coding Problems
On the Relation Between the Index Coding and the Network Coding Problems Salim El Rouayheb, Alex Sprintson, and Costas Georghiades Department of Electrical and Computer Engineering Texas A&M University,
More informationOn Network Coding Capacity - Matroidal Networks and Network Capacity Regions. Anthony Eli Kim
On Network Coding Capacity - Matroidal Networks and Network Capacity Regions by Anthony Eli Kim S.B., Electrical Engineering and Computer Science (2009), and S.B., Mathematics (2009) Massachusetts Institute
More informationThe Capacity of a Network
The Capacity of a Network April Rasala Lehman MIT Collaborators: Nick Harvey and Robert Kleinberg MIT What is the Capacity of a Network? Source a Source b c d e Sink f Sink What is the Capacity of a Network?
More informationOn Secure Index Coding with Side Information
On Secure Index Coding with Side Information Son Hoang Dau Division of Mathematical Sciences School of Phys. and Math. Sciences Nanyang Technological University 21 Nanyang Link, Singapore 637371 Email:
More informationQuasi-linear Network Coding
Quasi-linear Network Coding Moshe Schwartz Electrical and Computer Engineering Ben-Gurion University of the Negev Beer Sheva 8410501, Israel schwartz@ee.bgu.ac.il Abstract We present a heuristic for designing
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 5, MAY
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 5, MAY 2008 2303 Linear Network Codes and Systems of Polynomial Equations Randall Dougherty, Chris Freiling, and Kenneth Zeger, Fellow, IEEE Abstract
More informationA GRAPH-THEORETIC APPROACH TO NETWORK CODING
A GRAPH-THEORETIC APPROACH TO NETWORK CODING A Dissertation Presented to the Faculty of the Graduate School of Cornell University in Partial Fulfillment of the Requirements for the Degree of Doctor of
More informationNon-linear index coding outperforming the linear optimum
Non-linear index coding outperforming the linear optimum Eyal Lubetzky Uri Stav Abstract The following source coding problem was introduced by Birk and Kol: a sender holds a word x {0, 1} n, and wishes
More informationError Correcting Index Codes and Matroids
Error Correcting Index Codes and Matroids Anoop Thomas and B Sundar Rajan Dept of ECE, IISc, Bangalore 5612, India, Email: {anoopt,bsrajan}@eceiiscernetin arxiv:15156v1 [csit 21 Jan 215 Abstract The connection
More informationThe Minrank of Random Graphs
The Minrank of Random Graphs Alexander Golovnev Oded Regev Omri Weinstein Abstract The minrank of a directed graph G is the minimum rank of a matrix M that can be obtained from the adjacency matrix of
More informationStrong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach
Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach Silas Fong (Joint work with Vincent Tan) Department of Electrical & Computer Engineering National University
More informationLATTICES AND CODES ISHAY HAVIV TEL AVIV UNIVERSITY THE RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES THE BLAVATNIK SCHOOL OF COMPUTER SCIENCE
TEL AVIV UNIVERSITY THE RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES THE BLAVATNIK SCHOOL OF COMPUTER SCIENCE LATTICES AND CODES THESIS SUBMITTED FOR THE DEGREE OF DOCTOR OF PHILOSOPHY BY ISHAY
More informationNotes 6 : First and second moment methods
Notes 6 : First and second moment methods Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Roc, Sections 2.1-2.3]. Recall: THM 6.1 (Markov s inequality) Let X be a non-negative
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationNetwork Routing Capacity
1 Network Routing Capacity Jillian Cannons (University of California, San Diego) Randy Dougherty (Center for Communications Research, La Jolla) Chris Freiling (California State University, San Bernardino)
More informationSource Coding and Function Computation: Optimal Rate in Zero-Error and Vanishing Zero-Error Regime
Source Coding and Function Computation: Optimal Rate in Zero-Error and Vanishing Zero-Error Regime Solmaz Torabi Dept. of Electrical and Computer Engineering Drexel University st669@drexel.edu Advisor:
More informationAn Equivalence Between Secure Network and Index Coding
An Equivalence Between Secure Network Index Coding Lawrence Ong, Badri N. Vellambi, Jörg Kliewer, Phee Lep Yeoh The University of Newcastle, Australia; New Jersey Institute of Technology, USA; University
More informationLexicographic Products and the Power of Non-Linear Network Coding
Lexicographic Products and the Power of Non-Linear Network Coding Anna Blasiak Dept. of Computer Science Cornell University. ablasiak@cs.cornell.edu Robert Kleinberg Dept. of Computer Science Cornell University.
More informationAn Ins t Ins an t t an Primer
An Instant Primer Links from Course Web Page Network Coding: An Instant Primer Fragouli, Boudec, and Widmer. Network Coding an Introduction Koetter and Medard On Randomized Network Coding Ho, Medard, Shi,
More informationLinearly Representable Entropy Vectors and their Relation to Network Coding Solutions
2009 IEEE Information Theory Workshop Linearly Representable Entropy Vectors and their Relation to Network Coding Solutions Asaf Cohen, Michelle Effros, Salman Avestimehr and Ralf Koetter Abstract In this
More informationExploiting Symmetry in Computing Polyhedral Bounds on Network Coding Rate Regions
Exploiting Symmetry in Computing Polyhedral Bounds on Network Coding Rate Regions Jayant Apte John Walsh Department of Electrical and Computer Engineering Drexel University, Philadelphia NetCod, 205 NSF
More informationFractional Repetition Codes For Repair In Distributed Storage Systems
Fractional Repetition Codes For Repair In Distributed Storage Systems 1 Salim El Rouayheb, Kannan Ramchandran Dept. of Electrical Engineering and Computer Sciences University of California, Berkeley {salim,
More informationA Dual Fano, and Dual Non-Fano Matroidal Network
California State University, San Bernardino CSUSB ScholarWorks Electronic Theses, Projects, and Dissertations Office of Graduate Studies 6-2016 A Dual Fano, and Dual Non-Fano Matroidal Network Stephen
More informationLinear codes cannot approximate the network capacity within any constant factor
Electronic Colloquium on Computational Complexity, Report No. 141 (2014) Linear codes cannot approximate the network capacity within any constant factor Shachar Lovett Computer Science and Engineering
More informationNetwork Routing Capacity
1 Network Routing Capacity Jillian Cannons (University of California, San Diego) Randy Dougherty (Center for Communications Research, La Jolla) Chris Freiling (California State University, San Bernardino)
More informationNetwork coding for multiple unicast over directed acyclic networks
Graduate Theses and Dissertations Iowa State University Capstones, Theses and Dissertations 2013 Network coding for multiple unicast over directed acyclic networks Shurui Huang Iowa State University Follow
More informationReverse Edge Cut-Set Bounds for Secure Network Coding
Reverse Edge Cut-Set Bounds for Secure Network Coding Wentao Huang and Tracey Ho California Institute of Technology Michael Langberg University at Buffalo, SUNY Joerg Kliewer New Jersey Institute of Technology
More informationOn the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage
On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage Changho Suh Kannan Ramchandran Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report
More informationCS5314 Randomized Algorithms. Lecture 18: Probabilistic Method (De-randomization, Sample-and-Modify)
CS5314 Randomized Algorithms Lecture 18: Probabilistic Method (De-randomization, Sample-and-Modify) 1 Introduce two topics: De-randomize by conditional expectation provides a deterministic way to construct
More informationON INDEX CODING WITH SIDE INFORMATION
ON INDEX CODING WITH SIDE INFORMATION DAU SON HOANG SCHOOL OF PHYSICAL & MATHEMATICAL SCIENCES 2012 ON INDEX CODING WITH SIDE INFORMATION DAU SON HOANG School of Physical & Mathematical Sciences A thesis
More informationMulticast Packing for Coding across Multiple Unicasts
Multicast Packing for Coding across Multiple Unicasts Chun Meng INC, CUHK & EECS, UC Irvine cmeng1@uci.edu Hulya Seferoglu LIDS, MIT hseferog@mit.edu Athina Markopoulou EECS, UC Irvine athina@uci.edu Kenneth
More informationRandom Linear Intersession Network Coding With Selective Cancelling
2009 IEEE Information Theory Workshop Random Linear Intersession Network Coding With Selective Cancelling Chih-Chun Wang Center of Wireless Systems and Applications (CWSA) School of ECE, Purdue University
More informationCommunicating the sum of sources in a 3-sources/3-terminals network
Communicating the sum of sources in a 3-sources/3-terminals network Michael Langberg Computer Science Division Open University of Israel Raanana 43107, Israel Email: mikel@openu.ac.il Aditya Ramamoorthy
More informationOn queueing in coded networks queue size follows degrees of freedom
On queueing in coded networks queue size follows degrees of freedom Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard Laboratory for Information and Decision Systems, Massachusetts Institute of Technology,
More informationAlphabet Size Reduction for Secure Network Coding: A Graph Theoretic Approach
ALPHABET SIZE REDUCTION FOR SECURE NETWORK CODING: A GRAPH THEORETIC APPROACH 1 Alphabet Size Reduction for Secure Network Coding: A Graph Theoretic Approach Xuan Guang, Member, IEEE, and Raymond W. Yeung,
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 22 September 2009
College of Computer & Information Science Fall 2009 Northeastern University 22 September 2009 CS 7880: Algorithmic Power Tools Scribe: Eric Miles Lecture Outline: General Lovász Local Lemma Two Simple
More informationMulticast Packing for Coding across Multiple Unicasts
Multicast Packing for Coding across Multiple Unicasts Chun Meng INC, CUHK & EECS, UC Irvine cmeng@uci.edu Athina Markopoulou EECS, UC Irvine athina@uci.edu Hulya Seferoglu LIDS, MIT hseferog@mit.edu Kenneth
More informationNetwork Capacity under Traffic Symmetry: Wireline and Wireless Networks
Network Capacity under Traffic Symmetry: Wireline and Wireless Networks Sudeep Kamath, Sreeram Kannan, Pramod Viswanath ECE Department, University of California, San Diego, sudeep@eecs.berkeley.edu EECS
More informationSum-networks from undirected graphs: Construction and capacity analysis
Electrical and Computer Engineering Conference Papers Posters and Presentations Electrical and Computer Engineering 014 Sum-networks from undirected graphs: Construction and capacity analysis Ardhendu
More informationTwo Applications of the Gaussian Poincaré Inequality in the Shannon Theory
Two Applications of the Gaussian Poincaré Inequality in the Shannon Theory Vincent Y. F. Tan (Joint work with Silas L. Fong) National University of Singapore (NUS) 2016 International Zurich Seminar on
More informationBBM402-Lecture 20: LP Duality
BBM402-Lecture 20: LP Duality Lecturer: Lale Özkahya Resources for the presentation: https://courses.engr.illinois.edu/cs473/fa2016/lectures.html An easy LP? which is compact form for max cx subject to
More informationCharacteristic-Dependent Linear Rank Inequalities and Network Coding Applications
haracteristic-ependent Linear Rank Inequalities and Network oding pplications Randall ougherty, Eric Freiling, and Kenneth Zeger bstract Two characteristic-dependent linear rank inequalities are given
More informationECE Information theory Final (Fall 2008)
ECE 776 - Information theory Final (Fall 2008) Q.1. (1 point) Consider the following bursty transmission scheme for a Gaussian channel with noise power N and average power constraint P (i.e., 1/n X n i=1
More informationto be almost surely min{n 0, 3
1 The DoF Region of the Three-Receiver MIMO Broadcast Channel with Side Information and Its Relation to Index Coding Capacity Behzad Asadi, Lawrence Ong, and Sarah J Johnson arxiv:160803377v1 [csit] 11
More informationChain Independence and Common Information
1 Chain Independence and Common Information Konstantin Makarychev and Yury Makarychev Abstract We present a new proof of a celebrated result of Gács and Körner that the common information is far less than
More informationTHE idea of network coding over error-free networks,
Path Gain Algebraic Formulation for the Scalar Linear Network Coding Problem Abhay T. Subramanian and Andrew Thangaraj, Member, IEEE arxiv:080.58v [cs.it] 9 Jun 00 Abstract In the algebraic view, the solution
More informationInformation flows, graphs and their guessing numbers
Information flows, graphs and their guessing numbers Søren Riis Queen Mary, University of London smriis@dcs.qmul.ac.uk Submitted: Jan 9, 00; Accepted: May, 00; Published: Jun, 00 Mathematics Subject Classification:
More informationarxiv: v2 [cs.it] 23 Aug 2018
Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate Arya Mazumdar Andrew McGregor Sofya Vorotnikova arxiv:1706.09197v2 [cs.it] 23 Aug 2018 Abstract Motivated by applications
More informationProgress on High-rate MSR Codes: Enabling Arbitrary Number of Helper Nodes
Progress on High-rate MSR Codes: Enabling Arbitrary Number of Helper Nodes Ankit Singh Rawat CS Department Carnegie Mellon University Pittsburgh, PA 523 Email: asrawat@andrewcmuedu O Ozan Koyluoglu Department
More informationDistributed Reed-Solomon Codes
Distributed Reed-Solomon Codes Farzad Parvaresh f.parvaresh@eng.ui.ac.ir University of Isfahan Institute for Network Coding CUHK, Hong Kong August 216 Research interests List-decoding of algebraic codes
More informationLinear Codes, Target Function Classes, and Network Computing Capacity
Linear Codes, Target Function Classes, and Network Computing Capacity Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, and Kenneth Zeger IEEE Transactions on Information Theory Submitted:
More informationMaximum Flow. Jie Wang. University of Massachusetts Lowell Department of Computer Science. J. Wang (UMass Lowell) Maximum Flow 1 / 27
Maximum Flow Jie Wang University of Massachusetts Lowell Department of Computer Science J. Wang (UMass Lowell) Maximum Flow 1 / 27 Flow Networks A flow network is a weighted digraph G = (V, E), where the
More informationNP-Completeness. Andreas Klappenecker. [based on slides by Prof. Welch]
NP-Completeness Andreas Klappenecker [based on slides by Prof. Welch] 1 Prelude: Informal Discussion (Incidentally, we will never get very formal in this course) 2 Polynomial Time Algorithms Most of the
More informationjoint work with Elona Erez Tel Aviv University Meir Feder Overcoming Delay, Synchronization
Overcoming Delay, Synchronization and Cyclic Paths Meir Feder Tel Aviv University joint work with Elona Erez nd Cyclic Paths Root of the problem In much of network coding assume instantaneous coding Instantaneous
More informationAmulticast network is a directed multigraph containing a
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 10, OCTOBER 2004 2243 Linearity and Solvability in Multicast Networks Randall Dougherty, Christopher Freiling, and Kenneth Zeger, Fellow, IEEE Abstract
More informationLecture 4 Noisy Channel Coding
Lecture 4 Noisy Channel Coding I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw October 9, 2015 1 / 56 I-Hsiang Wang IT Lecture 4 The Channel Coding Problem
More informationDistributed storage systems from combinatorial designs
Distributed storage systems from combinatorial designs Aditya Ramamoorthy November 20, 2014 Department of Electrical and Computer Engineering, Iowa State University, Joint work with Oktay Olmez (Ankara
More informationApproximating Minimum-Power Degree and Connectivity Problems
Approximating Minimum-Power Degree and Connectivity Problems Guy Kortsarz Vahab S. Mirrokni Zeev Nutov Elena Tsanko Abstract Power optimization is a central issue in wireless network design. Given a graph
More informationCoding with Constraints: Minimum Distance. Bounds and Systematic Constructions
Coding with Constraints: Minimum Distance 1 Bounds and Systematic Constructions Wael Halbawi, Matthew Thill & Babak Hassibi Department of Electrical Engineering arxiv:1501.07556v2 [cs.it] 19 Feb 2015 California
More informationarxiv: v2 [cs.it] 13 Jul 2011
Index coding via linear programming Anna Blasiak Robert Kleinberg Eyal Lubetzky arxiv:1004.1379v2 [cs.it] 13 Jul 2011 Abstract Index Coding has received considerable attention recently motivated in part
More informationA tool oriented approach to network capacity. Ralf Koetter Michelle Effros Muriel Medard
A tool oriented approach to network capacity Ralf Koetter Michelle Effros Muriel Medard ralf.koetter@tum.de effros@caltech.edu medard@mit.edu The main theorem of NC [Ahlswede, Cai, Li Young, 2001] Links
More informationCases Where Finding the Minimum Entropy Coloring of a Characteristic Graph is a Polynomial Time Problem
Cases Where Finding the Minimum Entropy Coloring of a Characteristic Graph is a Polynomial Time Problem Soheil Feizi, Muriel Médard RLE at MIT Emails: {sfeizi,medard}@mit.edu Abstract In this paper, we
More informationDistributed Functional Compression through Graph Coloring
Distributed Functional Compression through Graph Coloring Vishal Doshi, Devavrat Shah, Muriel Médard, and Sidharth Jaggi Laboratory for Information and Decision Systems Massachusetts Institute of Technology
More informationCS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source Shortest
More informationDEDI: A Framework for Analyzing Rank Evolution of Random Network Coding in a Wireless Network
DEDI: A Framework for Analyzing Rank Evolution of Random Network Coding in a Wireless Network Dan Zhang Narayan Mandayam and Shyam Parekh WINLAB, Rutgers University 671 Route 1 South, North Brunswick,
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationAlgebraic network coding approach to deterministic wireless relay networks
Algebraic network coding approach to deterministic wireless relay networks The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation
More informationA Proof of the Converse for the Capacity of Gaussian MIMO Broadcast Channels
A Proof of the Converse for the Capacity of Gaussian MIMO Broadcast Channels Mehdi Mohseni Department of Electrical Engineering Stanford University Stanford, CA 94305, USA Email: mmohseni@stanford.edu
More informationOn the Feasibility of Precoding-Based Network Alignment for Three Unicast Sessions
On the Feasibility of Precoding-Based Network Alignment for Three Unicast Sessions Chun Meng, Abinesh Ramakrishnan, Athina Markopoulou, Syed Ali Jafar Department of Electrical Engineering and Computer
More informationINDEX coding has attracted significant attention in various
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 63, NO. 12, DECEMBER 2017 7687 Index Coding With Erroneous Side Information Jae-Won Kim and Jong-Seon No, Fellow, IEEE Abstract In this paper, new index coding
More informationNetwork Coding for Computing
Networ Coding for Computing Rathinaumar Appuswamy, Massimo Franceschetti, Nihil Karamchandani, and Kenneth Zeger Abstract The following networ computation problem is considered A set of source nodes in
More informationA computational approach for determining rate regions and codes using entropic vector bounds
1 A computational approach for determining rate regions and codes using entropic vector bounds Congduan Li, John MacLaren Walsh, Steven Weber Drexel University, Dept. of ECE, Philadelphia, PA 19104, USA
More informationAlignment-Based Network Coding for Two-Unicast-Z Networks
Alignment-Based Network Coding for Two-Unicast-Z Networks The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher
More informationLinear Exact Repair Rate Region of (k + 1, k, k) Distributed Storage Systems: A New Approach
Linear Exact Repair Rate Region of (k + 1, k, k) Distributed Storage Systems: A New Approach Mehran Elyasi Department of ECE University of Minnesota melyasi@umn.edu Soheil Mohajer Department of ECE University
More informationCode Construction for Two-Source Interference Networks
Code Construction for Two-Source Interference Networks Elona Erez and Meir Feder Dept. of Electrical Engineering-Systems, Tel Aviv University, Tel Aviv, 69978, Israel, E-mail:{elona, meir}@eng.tau.ac.il
More information