Optimal Index Codes with Near-Extreme Rates
|
|
- Beatrix Conley
- 5 years ago
- Views:
Transcription
1 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 University Nanyang Link, Singapore Vitaly Skachek Department of ECE McGill University 480 University Street Montréal, QC HA A7, Canada Yeow Meng Chee Division of Mathematical Sciences School of Phys. and Math. Sciences Nanyang Technological University Nanyang Link, Singapore Abstract The min-rank of a digraph was shown by Bar- Yossef et al. 006 to represent the length of an optimal scalar linear solution of the corresponding instance of the Index Coding with Side Information ICSI problem. In this work, the graphs and digraphs of near-extreme min-ranks are characterized. Those graphs and digraphs correspond to the ICSI instances having near-extreme transmission rates when using optimal scalar linear index codes. It is also shown that the decision problem of whether a digraph has min-rank two is NP-complete. By contrast, the same question for graphs can be answered in polynomial time. I. INTRODUCTION Index Coding with Side Information ICSI [] is a communication scheme dealing with broadcast channels in which receivers have prior side information about the messages to be broadcast. By using coding and by exploiting the knowledge about the side information, the sender may significantly reduce the number of required transmissions compared with the straightforward approach. Apart from being a special case of the well-known non-multicast Network Coding problem [], [], the ICSI problem has also found various potential applications on its owns, such as audio- and video-on-demand, daily newspaper delivery, data pushing, and oppoturnistic wireless networks [], [4], [5], [6]. In the work of Bar-Yossef et al. [4], the optimal transmission rate of scalar linear index codes for an ICSI instance was neatly characterized by the so-called min-rank of the side information digraph corresponding to that instance. The concept of min-rank of a graph goes back to Haemers [7]. Min-rank serves as an upper bound for the celebrated Shannon capacity of a graph [8]. It was shown by Peeters [9] that computing the min-rank of a general graph that is, the Min-Rank problem is a hard task. More specifically, Peeters showed that deciding whether the min-rank of a graph is smaller than or equal to three is an NP-complete problem. The interest in the Min-Rank problem has grown after the work of Bar-Yossef et al. [4]. Exact and heuristic algorithms for finding min-rank over the binary field of a digraph were developed in [0]. The minrank of a random digraph was investigated in []. A dynamic programming approach was proposed in [] to compute minranks of outerplanar graphs in polynomial time. The work of this author was done in part while he was with the Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL 680, USA. In this paper, we study graphs and digraphs that have nearextreme min-ranks. In other words, we study ICSI instances with n receivers for which optimal scalar linear index codes have transmission rates, n, n, or n. Consequently, we show that the problem of deciding whether a digraph has min-rank two over F is NP-complete. By contrast, the same decision problem for graphs can be solved in polynomial time. The characterizations of graphs and digraphs with nearextreme min-ranks are summarized in the table below. The star mark indicates that the result is established in this paper. Min-Rank Graph G Digraph D G is complete trivial D is complete trivial D is not complete G is not complete and G is - and D is fairly - colorable [9] colorable n G connected has a maximum matching of size two and does not unknown contain F Fig. 4 as a subgraph n G connected is a star graph unknown n G has no edges trivial D has no circuits The paper is organized as follows. Basic notations and definitions are presented in Section II. In Section III, we present characterization of graphs and digraphs of near-extreme minranks. In Section IV, we prove the hardness of the decision problem of whether a digraph has min-rank two. The full version of this paper is available at web.spms.ntu.edu.sg/ daus000/extremeic.pdf. II. NOTATIONS AND DEFINITIONS Let [n] = {,,...,n}. Let F q denote the finite field of q elements. The support of a vector u F n q is defined to be the set suppu = {i [n] : u i 0}. For an n k matrix M, let M i denote the ith row of M. For a set E [n], let M E denote the E k sub-matrix of M formed by rows of M which are indexed by the elements of E. For any matrix M over F q, we denote by rank q M the rank of M over F q. We use e i to denote the unit vector, which has a one at the ith position, and zeros elsewhere. A graph is a pair G = VG,EG where VG is the set of vertices of G, and EG, the edge set, is a set of unordered pairs of distinct vertices of G. A typical edge of G is of the form {i,j} where i,j VG, and i j. For a graph with n vertices, we often take [n] as the vertex set. A digraph //$.00 0 IEEE 5
2 D = VD,ED is defined similarly, except that ED is called the arc set, which is a set of ordered pairs of distinct vertices of D. A typical arc of D is of the form e = i,j where i,j VD, and i j. We note that any graph can be viewed as a digraph with the same set of vertices, where each edge in EG is replaced with two antiparallel arcs in ED. Ifi,j ED thenj is called an out-neighbor ofi. The set of out-neighbors of a vertex i in the digraph D is denoted by N D O i. We simply use N Oi whenever there is no potential confusion. For a graph G, we denote by N G i the set of neighbors of i, namely, the set of vertices adjacent to i. The order of a digraph is its number of vertices. The complement of a digraph D, denoted D, is a digraph with vertex set VD and arc set {i,j : i,j VD, i j, i,j / ED}. The complement of a graph is defined analogously. A circuit in a digraph D = VD,ED is a sequence of pairwise distinct vertices C = i,i,...,i r, where i s,i s+ ED for all s [r ] and i r,i ED as well. A digraph is called acyclic if it contains no circuits. The ICSI problem is formulated as follows. Suppose a sender S wants to send a vector x = x,x,...,x n, where x i F t q for alli [n], tonreceiversr,r,...,r n. EachR i possesses some prior side information, consisting of the blocks x j, j X i [n], and is interested in receiving a single block x i. The sender S broadcasts a codeword Ex F κ q, κ N, that enables each receiver R i to recover x i based on its side information. Such a mapping E is called an index code. We refer to t as the block length and κ as the length of the index code. The ratio κ/t is called the transmission rate of the index code. The objective of S is to find an optimal index code, that is, an index code which has the minimum transmission rate. The index code is called linear if E is an F q -linear mapping, and nonlinear otherwise. The index code is called scalar if t = and vector if t >. The length and the transmission rate of a scalar index code t = are identical. Example II.. Consider the following ICSI instance in which n = 5 and X = {}, X = {}, X = {,4}, X 4 = {5}, X 5 = {,4}. Assume that x i F i [5]. S R R R x +x x +x x 4 +x 5 R 5 requests x R 4 requests x 5 owns x owns x,x 4 requests x requests x requests x 4 owns x owns x owns x,x 5 4 Fig. : Example of an ICSI instance and an index code The sender broadcasts three packets x +x, x +x, and x 4 + x 5. This index code is of length three. The decoding process goes as follows. As R knows x and receives x +x, it obtains x = x + x + x ; Similarly, R obtains x = x +x +x ; R obtains x = x +x +x +x +x ; R 4 obtains x 4 = x 5 +x 4 +x 5 ; R 5 obtains x 5 = x 4 +x 4 +x 5. This index code saves two transmissions compared with the naïve approach when S broadcasts all five messages. Each instance of the ICSI problem can be described by the so-called side information digraph [4]. Given n and X i, i [n], the side information digraph D is defined as follows. The vertex set VD = [n]. The arc set ED = i [n] {i,j : j X i }. The side information digraph corresponding to the ICSI instance in Example II. is depicted in Fig. a. Definition II. [7], [4]. Let D = VD,ED be a digraph of order n. A matrix M = m i,j Fq n n is said to fit D if m i,i 0 and m i,j = 0 whenever i j and i,j / ED. The min-rank of D over F q, denoted minrk q D, is defined to be the minimum rank of a matrix in Fq n n that fits D. Since a graph can be viewed as a special case of a digraph, the above definitions also apply to a graph. 5 4 a Side information digraph D b A rank-three matrix that fits D Fig. : Corresponding side information digraph Example II. Bar-Yossef et al. [4] showed that the length transmission rate of an optimal scalar linear index code for the ICSI instance described by D is precisely the min-rank of D. Let β q t,d denotes the length of an optimal vector index code of block length t over F q for an ICSI instance described by a digraphd. Lubetzky et al. [] defined the broadcast rateβ q D of the corresponding ICSI instance to be lim t β q t,d/t see also [4]. Then minrk q D is an upper bound on β q D. Theorem II. [7], [4], [4]. For any digraph D we have αd β q D minrk q D, where αd denotes the size of a maximum acyclic induced subgraph of D. The same inequalities hold for a graph G, where αg denotes the size of a maximum independent set of G. III. DIGRAPHS OF NEAR-EXTREME MIN-RANKS A. Digraphs of Min-Rank One Proposition III.. A digraph has min-rank one over F q if and only if it is a complete digraph. Due to Theorem II., it is also trivial to see that β q D = if and only if D is a complete digraph. B. Digraphs of Min-Rank Two It was observed by Peeters [9] that a graph has min-rank two if and only if it is not a complete graph and its complement is a bipartite graph. We now focus only on digraphs of min-rank two. In this section, only the binary alphabet is considered. We first introduce the following concept of a fair coloring of a digraph. Recall that a k-coloring of a graph G = VG,EG is a mapping φ : VG [k] which satisfies 5
3 the condition that φi φj whenever {i,j} EG. We often refer to φi as the color of i. If there exists a k-coloring of G, then we say that G is k-colorable. Definition III.. Let D = VD,ED be a digraph. A fair k-coloring of D is a mapping φ : VD [k] that satisfies the following conditions C If i,j ED then φi φj; C For each vertex i of D, it holds that φj = φh for all out-neighbors j and h of i. If there exists a fair k-coloring of D, we say that we can color D fairly by k colors, or, D is fairly k-colorable. Lemma III.. A digraph D = VD, ED is fairly - colorable if and only if there exists a partition of VD into three subsets A, B, and C that satisfy the following conditions For every i A: either N O i B or N O i C; For every i B: either N O i A or N O i C; For every i C: either N O i A or N O i B. Theorem III.4. Let D = VD,ED be a digraph. Then minrk D if and only if D, the complement of D, is fairly -colorable. Proof: Suppose VD = [n]. The ONLY IF direction: By the definition of min-rank, minrk D implies the existence of an n n binary matrix M of rank at most two that fits D. There must be some two rows of M that span its entire row space. Without loss of generality, suppose that they are the first two rows of M, namely, M and M these two rows might be linearly dependent if minrk D <. Let B = suppm suppm, A = suppm \ B, and C = suppm \B. Since the binary alphabet is considered and the matrix M has no zero rows, for every i [n], one of the following must hold: M i = M ; M i = M ; M i = M + M. Hence i suppm i A B C for every i [n]. This implies that A B C = [n]. Suppose that i A. Then either M i = M or M i = M + M. The former condition holds if and only if suppm i = A B, which in turns implies that i,j ED for all j A B \{i}. In other words, i,j / ED for all j A B. Here D = VD,ED is the complement of D. The latter condition holds if and only if suppm i = A C, which implies that i, j / ED for all j A C. In summary, for every i A we have i,j / ED, for all j A; Either i,j / ED, for all j B, or i,j / ED, for all j C; In other words, for every i A, either NO D i B or NO D i C. Analogous conditions hold for every i B and for every i C as well. Therefore, by Lemma III., D is fairly -colorable. The IF direction: Suppose now that D is fairly -colorable. It suffices to find an n n binary matrix M of rank at most two which fits D. By Lemma III., there exists a partition of VD into three subsets A, B, and C that satisfy the following three conditions For every i A: either NO Di B or ND O i C; For every i B: either NO Di A or ND O i C; For every i C: either NO Di A or ND O i B. We construct an n n matrix M = m i,j as follows. For each i A, if NO Di B then let m i,j = for j A C, and m i,j = 0 for j B. Otherwise, if NO D i C then let m i,j = for j A B, and m i,j = 0 for j C. For i B and i C, M i can be constructed analogously. It is obvious that M fits D. Moreover, each row of M can be written as a linear combinations of the two binary vectors whose supports are A B and B C, respectively. Therefore, rank q M. We complete the proof. The following corollary characterizes the digraphs of minrank two. Corollary III.5. A digraph D has min-rank two over F if and only if D is fairly -colorable and D is not a complete digraph. For a graph G, it was proved by Blasiak et al. [5] that β G = if and only if G is bipartite and G is not a complete graph. A characterization by forbidden subgraphs of digraphs D with β D = was also obtained therein. C. Digraphs of Min-Ranks Equal to Their Orders Proposition III.6. Let G be a graph of order n. Then minrk q G = n if and only if G has no edges. Proposition III.7. Let D be a digraph of order n. Then minrk q D = n if and only if D is acyclic. Proof: Equivalently, we show that minrk q D n if and only if D has a circuit. Let VD = [n]. Suppose D has a circuit C = i,i,...,i r. We construct a matrix M fitting D as follows. Let VC = {i,...,i r }. For j / VC, letm j = e j. Fors [r ], letm is = e is e is+. Finally, let M ir = e i e ir. Clearly, M fits D. Moreover, as M ir = r s= M i s, we have rank q M VC r. Hence rank q M = rank q MVC +rankq M[n]\VC r +n r = n. Therefore, minrk q D n. Conversely, suppose that minrk q D n. By Theorem II., αd n. Therefore, D contains a circuit. By Theorem II., it is not hard to see that Proposition III.6 and III.7 also hold if we replace minrk q by β q. D. Graphs of Min-Ranks One Less Than Their Orders Definition III.8. A graph G = VG,EG is called a star graph if VG and there exists a vertex i VG such that EG = { {i,j} : j VG\{i} }. Fig. : A star graph Theorem III.9. Let G be a connected graph of order n. Then minrk q G = n if and only if G is a star graph. 5
4 Proof: We first suppose that minrk q G = n. If n = then G must be a complete graph, which is a star graph. We assume thatn. AsG is connected, there exists a vertex i of degree at least two. Let i and i be any two distinct vertices adjacent to i. Our goal is to show that for every vertex j i, we have {i,j} EG, and those are all possible edges. Firstly, suppose for a contradiction that {i, j} / EG for some j i. Since G is connected, there exists k such that {j,k} EG. Then either k i or k i. Suppose that k i. We create a matrix M as follows. Let M j = M k = e j + e k, M i = M i = e i + e i, and M h = e h for h / {i,j,i,k}. Then M fits G and rank q M n. Therefore, minrk q G < n. We obtain a contradiction. Thus, all other vertices are adjacent to i. Secondly, suppose for a contradiction that there exist two adjacent vertices, namely j and k, both are different from i. As we just proved, both j and k must be adjacent to i. We create a matrix M as follows. We take M i = M j = M k = e i + e j + e k, and M h = e h for h / {i,j,k}. Clearly M fits G and moreover, rank q M n, which implies that minrk q G < n. We obtain a contradiction. Conversely, assume that G is a star graph, where EG = { {i,js } : s [n ] }, j s VG\{i} for all s [n ]. We create a matrix M fitting G by taking M js = e i +e js for s [n ], and M i = e i +e j. Since M i M j, we deduce that rank q M n. Hence minrk q G n. On the other hand, since{j s : s [n ]} is a maximum independent set in G, we obtain that αg = n. By Theorem II., minrk q G αg = n. Thus, minrk q G = n. It is not hard to see that Theorem III.9 still holds with minrk q being replaced by β q. E. Graphs of Min-Ranks Two Less Than Their Orders A matching in a graph is a set of edges without common vertices. A maximum matching is a matching that contains the largest possible number of edges. The number of edges in a maximum matching in G is denoted by mmg. Theorem III.0. Suppose G is a connected graph of order n 6. Then minrk q G = n if and only if mmg = and G does not contain a subgraph isomorphic to the graph F depicted in Fig. 4. minrk q G n mmg = n. As αg minrk q G, it suffices to show that αg = n. Let {a,b} and {c,d} be the two edges in a maximum matching in G. Let U = {a,b,c,d} and V = VG\U. The main idea is to show that we can always find two nonadjacent vertices in U which are not adjacent to any vertex in V. Such two vertices can be added to V to obtain an independent set of size n, which establishes the proof. It is also not hard to see that Theorem III.0 still holds with minrk q being replaced by β q. IV. THE HARDNESS OF THE MIN-RANK PROBLEM FOR DIGRAPHS In this section, we first prove that the decision problem of whether a given digraph is fairly k-colorable see Definition III. is NP-complete, for any given k. The hardness of this problem, by Proposition III. and Corollary III.5, leads to the hardness of the decision problem of whether a given digraph has min-rank two overf. The fairk-coloring problem is defined formally as follows. Problem: FAIR k-coloring Instance: A digraph D, an integer k Output: True if D is fairly k-colorable, False otherwise Theorem IV.. The fair k-coloring problem is NP-complete for k. Proof: This problem is obviously in NP. For NP-hardness, we reduce the k-coloring problem to the fair k-coloring problem. Suppose that G = VG,EG is an arbitrary graph. We aim to build a digraph D = VD,ED so that G is k- colorable if and only if D is fairly k-colorable. Suppose that VG = [n]. For each i [n], we build the following gadget, which is a digraph D i = V i,e i. The vertex set of D i is V i = {i} { ω i,ij : i j N G i }, where ω i,ij are newly introduced vertices. We refer to ω i,ij as a clone in D i of the vertex i j [n]. The arc set of D i is E i = { ω i,ij,i : i j N G i }. Let N G i = {i,i,...,i ni }. Then D i is depicted in Fig. 5. i Fig. 4: The forbidden subgraph F Sketch of the proof: For the ONLY IF direction, suppose that minrk q G = n. It is not hard to see that minrk q G n mmg. Hence mmg. As mmg {0,} and VG 6 imply that either G has no edges minrk q G = n > n or G is a star graph minrk q G = n > n, we deduce that mmg =. Moreover, as the graph F has min-rank three less than its order, G should not contain any subgraph isomorphic to F. We now turn to the IF direction. Suppose that mmg = and G does not contain any subgraph isomorphic to F. Then ω i,i ω i,i ω i,ini Fig. 5: Gadget D i for each vertex i of G Additionally, we also introduce n new vertices p,p,...,p n. The digraph D = VD,ED is built as follows. The vertex set of D is Let VD = n i= V i {p,p,...,p n }. Q i = { p i,i } { p i,ω i,i j : i [n], j [n i ], i j = i }, 54
5 be the set consisting of p i,i and the arcs that connect p i and all the clones of i. The arc set of D is then defined to be ED = n i= E i n i= Q i. For example, if G is the graph in Fig. 6, then D is the digraph in Fig. 7. Fig. 6: An example of the graph G ω, ω, ω, ω, p p p Fig. 7: The digraph D built from the graph G in Fig. 6 Our goal now is to show that G is k-colorable if and only if D is fairly k-colorable. Suppose that G is k-colorable and φ G : [n] [k] is a k- coloring of G. We define φ D : VD [k] as follows For every i [n], φ D i = φ G i; If i j = i, then φ Dω i,i j = φ D i = φ G i, in other words, clones of i have the same color as i; For every i [n], φ D p i is chosen arbitrarily, as long as it is different from φ D i. We claim that φ D is a fair k-coloring for D. We first verify the condition C see Definition III.. It is straightforward from the definition of φ D that the endpoints of each of the arcs of the forms p i,i for i [n], and p i,ω i,i j for i j = i, have different colors. It remains to verify that i and ω i,ij have different colors. On the one hand, ω i,ij is a clone of i j, and hence has the same color as i j. In other words, φ D ω i,ij = φ D i j = φ G i j. On the other hand, since i j N G i, we obtain that φ G i j φ G i = φ D i. Hence, φ D ω i,ij φ D i i [n]. Thus, C is satisfied. We now check if C see Definition III. is also satisfied. The out-neighbors of p i are i and its clones, namely, ω i,i j with i j = i. These vertices have the same color in D by the definition of φ D. Thus C is also satisfied. Therefore φ D is a fair k-coloring of D. Conversely, suppose that φ D : VD [k] is a fair k- coloring of D. Condition C guarantees that all clones of i have the same color asi, namely,φ D ω i,i j = φ Di ifi j = i. Therefore, by C, if {i,j} EG, that is, j N G i, then φ D i φ D ω i,j = φ D j. Hence, if we define φ G : [n] [k] by φ G i = φ D i for all i [n], then it is a k-coloring of G. Thus G is k-colorable. Finally, notice that the order of D is a polynomial with respect to the order of G. More specifically, VD = VG + EG and ED = VG + 4 EG. Moreover, building D from G, and also obtaining a coloring of G from a coloring of D, can be done in polynomial time in VG. Since the k-coloring problem k is NP-hard [6], we conclude that the fair k-coloring problem is also NP-hard. Corollary IV.. Given an arbitrary digraph D, the decision problem of whether minrk D = is NP-complete. Recall that for a graph G, it was observed by Peeters [9] that G has min-rank two if and only if G is a bipartite graph and G is not a complete graph, which can be verified in polynomial time. Another related result, presented by Blasiak et al. [5], stated that there is a polynomial time algorithm to verify whether β D = for a general digraph D. REFERENCES [] Y. Birk and T. Kol, Informed-source coding-on-demand ISCOD over broadcast channels, in Proc. IEEE Conf. on Comput. Commun. INFOCOM, San Francisco, CA, 998, pp [] R. Ahlswede, N. Cai, S. Y. R. Li, and R. W. Yeung, Network information flow, IEEE Trans. Inform. Theory, vol. 46, pp. 04 6, 000. [] R. Koetter and M. Médard, An algebraic approach to network coding, IEEE/ACM Trans. Netw., vol., pp , 00. [4] Z. Bar-Yossef, Z. Birk, T. S. Jayram, and T. Kol, Index coding with side information, in Proc. 47th Annu. IEEE Symp. on Found. of Comput. Sci. FOCS, 006, pp [5] S. El Rouayheb, A. Sprintson, and C. Georghiades, On the index coding problem and its relation to network coding and matroid theory, IEEE Trans. Inform. Theory, vol. 56, no. 7, pp , 00. [6] S. Katti, H. Rahul, W. Hu, D. Katabi, M. Médard, and J. Crowcroft, Xors in the air: Practical wireless network coding, in Proc. ACM SIGCOMM, 006, pp [7] W. Haemers, An upper bound for the shannon capacity of a graph, Algebr. Methods Graph Theory, vol. 5, pp. 67 7, 978. [8] C. E. Shannon, The zero-error capacity of a noisy channel, IRE Trans. Inform. Theory, vol., pp. 5, 956. [9] R. Peeters, Orthogonal representations over finite fields and the chromatic number of graphs, Combinatorica, vol. 6, no., pp. 47 4, 996. [0] M. A. R. Chaudhry and A. Sprintson, Efficient algorithms for index coding, in Proc. IEEE Conf. on Comput. Commun. INFOCOM, 008, pp. 4. [] I. Haviv and M. Langberg, On linear index coding for random graphs, 0, preprint. [] Y. Berliner and M. Langberg, Index coding with outerplanar side information, in Proc. IEEE Symp. on Inform. Theory ISIT, Saint Petersburg, Russia, 0, pp [] E. Lubetzky and U. Stav, Nonlinear index coding outperforming the linear optimum, IEEE Trans. Inform. Theory, vol. 55, no. 8, pp , 009. [4] N. Alon, A. Hassidim, E. Lubetzky, U. Stav, and A. Weinstein, Broadcasting with side information, in Proc. 49th Annu. IEEE Symp. on Found. of Comput. Sci. FOCS, 008, pp [5] A. Blasiak, R. Kleinberg, and E. Lubetzky, Index coding via linear programming, 0, preprint. [6] R. M. Karp, Reducibility among combinatorial problems, Complexity Comput. Comput., vol. 40, no. 4, pp. 85 0,
On 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 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 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 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 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 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 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 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 informationIndex Coding Algorithms for Constructing Network Codes. Salim El Rouayheb. Illinois Institute of Technology, Chicago
Index Coding Algorithms for Constructing Network Codes Salim El Rouayheb Illinois Institute of Technology, Chicago Matlab Code with GUI for Constructing Linear Network Codes Matlab outputs network code
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 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 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 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 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 informationA Relation Between Weight Enumerating Function and Number of Full Rank Sub-matrices
A Relation Between Weight Enumerating Function and Number of Full Ran Sub-matrices Mahesh Babu Vaddi and B Sundar Rajan Department of Electrical Communication Engineering, Indian Institute of Science,
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 informationA Polynomial-Time Algorithm for Pliable Index Coding
1 A Polynomial-Time Algorithm for Pliable Index Coding Linqi Song and Christina Fragouli arxiv:1610.06845v [cs.it] 9 Aug 017 Abstract In pliable index coding, we consider a server with m messages and n
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 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 informationIndex 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 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 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 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 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 informationWeakly Secure Data Exchange with Generalized Reed Solomon Codes
Weakly Secure Data Exchange with Generalized Reed Solomon Codes Muxi Yan, Alex Sprintson, and Igor Zelenko Department of Electrical and Computer Engineering, Texas A&M University Department of Mathematics,
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 informationPaths and cycles in extended and decomposable digraphs
Paths and cycles in extended and decomposable digraphs Jørgen Bang-Jensen Gregory Gutin Department of Mathematics and Computer Science Odense University, Denmark Abstract We consider digraphs called extended
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 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 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 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 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 informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
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 informationSecurity in Locally Repairable Storage
1 Security in Locally Repairable Storage Abhishek Agarwal and Arya Mazumdar Abstract In this paper we extend the notion of locally repairable codes to secret sharing schemes. The main problem we consider
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 informationChapter 6 Orthogonal representations II: Minimal dimension
Chapter 6 Orthogonal representations II: Minimal dimension Nachdiplomvorlesung by László Lovász ETH Zürich, Spring 2014 1 Minimum dimension Perhaps the most natural way to be economic in constructing an
More informationGraph independent field size bounds on failure protecting network codes
Egerváry Research Group on Combinatorial Optimization Technical reports TR-25-. Published by the Egerváry Research Group, Pázmány P. sétány /C, H 7, Budapest, Hungary. Web site: www.cs.elte.hu/egres. ISSN
More informationAcyclic and Oriented Chromatic Numbers of Graphs
Acyclic and Oriented Chromatic Numbers of Graphs A. V. Kostochka Novosibirsk State University 630090, Novosibirsk, Russia X. Zhu Dept. of Applied Mathematics National Sun Yat-Sen University Kaohsiung,
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 informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationPreliminaries and Complexity Theory
Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
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 informationOut-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
More informationarxiv: v1 [cs.it] 19 Jun 2008
Broadcasting with side information Noga Alon Avinatan Hasidim Eyal Lubetzky Uri Stav Amit Weinstein arxiv:0806.3246v1 [cs.it] 19 Jun 2008 Abstract A sender holds a word x consisting of n blocks x i, each
More informationOn a Conjecture of Thomassen
On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,
More informationLow-Power Cooling Codes with Efficient Encoding and Decoding
Low-Power Cooling Codes with Efficient Encoding and Decoding Yeow Meng Chee, Tuvi Etzion, Han Mao Kiah, Alexander Vardy, Hengjia Wei School of Physical and Mathematical Sciences, Nanyang Technological
More informationGroup Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
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 informationOn the complexity of maximizing the minimum Shannon capacity in wireless networks by joint channel assignment and power allocation
On the complexity of maximizing the minimum Shannon capacity in wireless networks by joint channel assignment and power allocation Mikael Fallgren Royal Institute of Technology December, 2009 Abstract
More informationAcyclic subgraphs with high chromatic number
Acyclic subgraphs with high chromatic number Safwat Nassar Raphael Yuster Abstract For an oriented graph G, let f(g) denote the maximum chromatic number of an acyclic subgraph of G. Let f(n) be the smallest
More informationACO Comprehensive Exam October 14 and 15, 2013
1. Computability, Complexity and Algorithms (a) Let G be the complete graph on n vertices, and let c : V (G) V (G) [0, ) be a symmetric cost function. Consider the following closest point heuristic for
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 informationOn Linear Subspace Codes Closed under Intersection
On Linear Subspace Codes Closed under Intersection Pranab Basu Navin Kashyap Abstract Subspace codes are subsets of the projective space P q(n), which is the set of all subspaces of the vector space F
More informationMinimal Paths and Cycles in Set Systems
Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive
More informationCS264: Beyond Worst-Case Analysis Lecture #11: LP Decoding
CS264: Beyond Worst-Case Analysis Lecture #11: LP Decoding Tim Roughgarden October 29, 2014 1 Preamble This lecture covers our final subtopic within the exact and approximate recovery part of the course.
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationThe chromatic number of ordered graphs with constrained conflict graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 69(1 (017, Pages 74 104 The chromatic number of ordered graphs with constrained conflict graphs Maria Axenovich Jonathan Rollin Torsten Ueckerdt Department
More informationBounds on the generalised acyclic chromatic numbers of bounded degree graphs
Bounds on the generalised acyclic chromatic numbers of bounded degree graphs Catherine Greenhill 1, Oleg Pikhurko 2 1 School of Mathematics, The University of New South Wales, Sydney NSW Australia 2052,
More informationCooperative Multi-Sender Index Coding
Cooperative Multi-Sender Index Coding 1 Min Li Lawrence Ong and Sarah J. Johnson Abstract arxiv:1701.03877v3 [cs.it] 6 Feb 2017 In this paper we establish new capacity bounds for the multi-sender unicast
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 informationMath 5707: Graph Theory, Spring 2017 Midterm 3
University of Minnesota Math 5707: Graph Theory, Spring 2017 Midterm 3 Nicholas Rancourt (edited by Darij Grinberg) December 25, 2017 1 Exercise 1 1.1 Problem Let G be a connected multigraph. Let x, y,
More informationInteger-Forcing Linear Receiver Design over MIMO Channels
Globecom 0 - Signal Processing for Communications Symposium Integer-Forcing inear Receiver Design over MIMO Channels ili Wei, Member, IEEE and Wen Chen, Senior Member, IEEE Department of Electronic Engineering,
More informationThe Chromatic Number of Ordered Graphs With Constrained Conflict Graphs
The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs Maria Axenovich and Jonathan Rollin and Torsten Ueckerdt September 3, 016 Abstract An ordered graph G is a graph whose vertex set
More informationDecomposition of random graphs into complete bipartite graphs
Decomposition of random graphs into complete bipartite graphs Fan Chung Xing Peng Abstract We consider the problem of partitioning the edge set of a graph G into the minimum number τg of edge-disjoint
More informationBeyond the Butterfly A Graph-Theoretic Characterization of the Feasibility of Network Coding with Two Simple Unicast Sessions
Beyond the Butterfly A Graph-Theoretic Characterization of the Feasibility of Network Coding with Two Simple Unicast Sessions Chih-Chun Wang Center for Wireless Systems and Applications (CWSA) School of
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 informationQuasi-parity and perfect graphs. Irena Rusu. L.R.I., U.R.A. 410 du C.N.R.S., bât. 490, Orsay-cedex, France
Quasi-parity and perfect graphs Irena Rusu L.R.I., U.R.A. 410 du C.N.R.S., bât. 490, 91405 Orsay-cedex, France Abstract In order to prove the Strong Perfect Graph Conjecture, the existence of a simple
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 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 informationThe maximum edge biclique problem is NP-complete
The maximum edge biclique problem is NP-complete René Peeters Department of Econometrics and Operations Research Tilburg University The Netherlands April 5, 005 File No. DA5734 Running head: Maximum edge
More informationAn 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts
An 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts Alexander Ageev Refael Hassin Maxim Sviridenko Abstract Given a directed graph G and an edge weight function w : E(G) R +, themaximumdirectedcutproblem(max
More informationMaximum Distance Separable Symbol-Pair Codes
2012 IEEE International Symposium on Information Theory Proceedings Maximum Distance Separable Symbol-Pair Codes Yeow Meng Chee, Han Mao Kiah, and Chengmin Wang School of Physical and Mathematical Sciences,
More informationAn Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs Zhi-Zhong Chen Ruka Tanahashi Lusheng Wang Abstract We present a polynomial-time approximation algorithm for legally coloring
More informationThe Turán number of sparse spanning graphs
The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic
More informationLocally Encodable and Decodable Codes for Distributed Storage Systems
Locally Encodable and Decodable Codes for Distributed Storage Systems Son Hoang Dau, Han Mao Kiah, Wentu Song, Chau Yuen Singapore University of Technology and Design, Nanyang Technological University,
More informationNear-domination in graphs
Near-domination in graphs Bruce Reed Researcher, Projet COATI, INRIA and Laboratoire I3S, CNRS France, and Visiting Researcher, IMPA, Brazil Alex Scott Mathematical Institute, University of Oxford, Oxford
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
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 informationBounds on Shannon Capacity and Ramsey Numbers from Product of Graphs
Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs Xiaodong Xu Guangxi Academy of Sciences Nanning, Guangxi 530007, China xxdmaths@sina.com and Stanis law P. Radziszowski Department of
More informationPolynomial-time Reductions
Polynomial-time Reductions Disclaimer: Many denitions in these slides should be taken as the intuitive meaning, as the precise meaning of some of the terms are hard to pin down without introducing the
More informationA characterization of graphs by codes from their incidence matrices
A characterization of graphs by codes from their incidence matrices Peter Dankelmann Department of Mathematics University of Johannesburg P.O. Box 54 Auckland Park 006, South Africa Jennifer D. Key pdankelmann@uj.ac.za
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationContainment restrictions
Containment restrictions Tibor Szabó Extremal Combinatorics, FU Berlin, WiSe 207 8 In this chapter we switch from studying constraints on the set operation intersection, to constraints on the set relation
More informationMa/CS 6b Class 25: Error Correcting Codes 2
Ma/CS 6b Class 25: Error Correcting Codes 2 By Adam Sheffer Recall: Codes V n the set of binary sequences of length n. For example, V 3 = 000,001,010,011,100,101,110,111. Codes of length n are subsets
More informationData Gathering and Personalized Broadcasting in Radio Grids with Interferences
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences Jean-Claude Bermond a,, Bi Li a,b, Nicolas Nisse a, Hervé Rivano c, Min-Li Yu d a Coati Project, INRIA I3S(CNRS/UNSA), Sophia
More informationPacking triangles in regular tournaments
Packing triangles in regular tournaments Raphael Yuster Abstract We prove that a regular tournament with n vertices has more than n2 11.5 (1 o(1)) pairwise arc-disjoint directed triangles. On the other
More informationComputing linear functions by linear coding over networks
Computing linear functions by linear coding over networks Rathinakumar Appuswamy, Massimo Franceschetti Abstract We consider the scenario in which a set of sources generate messages in a network and a
More informationTopics in Graph Theory
Topics in Graph Theory September 4, 2018 1 Preliminaries A graph is a system G = (V, E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End
More informationWelsh s problem on the number of bases of matroids
Welsh s problem on the number of bases of matroids Edward S. T. Fan 1 and Tony W. H. Wong 2 1 Department of Mathematics, California Institute of Technology 2 Department of Mathematics, Kutztown University
More informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationClaw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version.
Claw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version. Part II. Nontrivial strip-structures Maria Chudnovsky Department of Industrial Engineering and Operations Research Columbia
More informationChapter 7. Error Control Coding. 7.1 Historical background. Mikael Olofsson 2005
Chapter 7 Error Control Coding Mikael Olofsson 2005 We have seen in Chapters 4 through 6 how digital modulation can be used to control error probabilities. This gives us a digital channel that in each
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 informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh June 2009 1 Linear independence These problems both appeared in a course of Benny Sudakov at Princeton, but the links to Olympiad problems are due to Yufei
More informationCluster Graph Modification Problems
Cluster Graph Modification Problems Ron Shamir Roded Sharan Dekel Tsur December 2002 Abstract In a clustering problem one has to partition a set of elements into homogeneous and well-separated subsets.
More informationKey words: Batch codes, error-correcting codes, computationally-private information retrieval, load balancing, distributed storage.
Linear Batch Codes Helger Lipmaa and Vitaly Skachek Abstract In an application, where a client wants to obtain many symbols from a large database, it is often desirable to balance the load. Batch codes
More informationICALP g Mingji Xia
: : ICALP 2010 g Institute of Software Chinese Academy of Sciences 2010.7.6 : 1 2 3 Matrix multiplication : Product of vectors and matrices. AC = e [n] a ec e A = (a e), C = (c e). ABC = e,e [n] a eb ee
More information