Distributed Reed-Solomon Codes
|
|
- Hubert Byrd
- 6 years ago
- Views:
Transcription
1 Distributed Reed-Solomon Codes Farzad Parvaresh University of Isfahan Institute for Network Coding CUHK, Hong Kong August 216
2 Research interests List-decoding of algebraic codes Construction of efficient list-decodable codes over GF(2) Efficient List-decoding of RS codes beyond the Johnson bound Applications of compressed sensing Phase retrieval problem Power optimization over relay network Computing the cut-set bound of a relay network efficiently Computing diversity multiplexing tradeoff of generalized half-duplex relay networks Any fun problem
3 Research interests List-decoding of algebraic codes Construction of efficient list-decodable codes over GF(2) Efficient List-decoding of RS codes beyond the Johnson bound Applications of compressed sensing Phase retrieval problem Power optimization over relay network Computing the cut-set bound of a relay network efficiently Computing diversity multiplexing tradeoff of generalized half-duplex relay networks Any fun problem
4 Research interests List-decoding of algebraic codes Construction of efficient list-decodable codes over GF(2) Efficient List-decoding of RS codes beyond the Johnson bound Applications of compressed sensing Phase retrieval problem Power optimization over relay network Computing the cut-set bound of a relay network efficiently Computing diversity multiplexing tradeoff of generalized half-duplex relay networks
5 Reed-Solomon codes Encoding of RS(n,k,d): Information symbols: (u 1, u 2,, u k ) Fk q f X = u 1 + u 2 X + + u k X k 1 F q [X] Polynomial evaluation: f α 1, f α 2,, f(α n ) α 1,, α n Codeword: (c 1, c 2,, c n ) F q n F q n
6 Reed-Solomon codes Encoding of RS(n,k,d): Information symbols: (u 1, u 2,, u k ) Fk q f X = u 1 + u 2 X + + u k X k 1 F q [X] Polynomial evaluation: f α 1, f α 2,, f(α n ) α 1,, α n Equivalently: (u 1, u 2,, u k ) Codeword: (c 1, c 2,, c n ) F q n 1 1 k 1 α 1 αk 1 n = (c 1, c 2,, c n ) F q n
7 Reed-Solomon codes Encoding of RS(n,k,d): Information symbols: (u 1, u 2,, u k ) Fk q f X = u 1 + u 2 X + + u k X k 1 F q [X] Polynomial evaluation: f α 1, f α 2,, f(α n ) α 1,, α n Equivalently: (u 1, u 2,, u k ) Codeword: (c 1, c 2,, c n ) F q n 1 1 k 1 α 1 αk 1 n Generator matrix, G RS, of RS code. = (c 1, c 2,, c n ) F q n
8 Reed-Solomon Encoding u 1 u 2 u k Encoders: v 1 v 2 v n c 1 =ug 1 c 2 =ug 2 c n =ug n G RS g1 g2 gn G RS is usually a Vandermonde matrix
9 Reed-Solomon Encoding Has access to all data u 1 u 2 u k Encoders: v 1 v 2 v n c 1 =ug 1 c 2 =ug 2 c n =ug n G RS g 1 g 2 g n G RS is usually a Vandermonde matrix
10 Distributed RS Encoding u 1 u 2 u k v 1 v 2 v n c 1 =ug 1 c 2 =ug 2 c n =ug n n RS g g g G 2 1 Encoders:
11 Distributed RS Encoding u 1 u 2 u k v 1 v 2 v n c 1 =ug 1 c 2 =ug 2 c n =ug n n RS g g g G 2 1 Encoders:
12 Distributed RS Encoding u 1 u 2 u k v 1 v 2 v n c 1 =ug 1 c 2 =ug 2 c n =ug n n RS g g g G 2 1 Encoders:
13 Distributed RS Encoding u 1 u 2 u k v 1 v 2 v n c 1 =ug 1 c 2 =ug 2 c n =ug n n RS g g g G 2 1 Encoders:
14 Distributed RS Encoding u 1 u 2 u k v 1 v 2 v n c 1 =ug 1 c 2 =ug 2 c n =ug n n RS g g g G 2 1 Encoders:
15 Distributed RS Encoding u 1 u 2 u k v 1 v 2 v n c 1 =ug 1 c 2 =ug 2 c n =ug n n RS g g g G 2 1 Encoders:
16 Distributed RS Encoding u 1 u 2 u k v 1 v 2 v n c 1 =ug 1 c 2 =ug 2 c n =ug n n RS g g g G 2 1 Encoders:
17 Distributed RS Encoding Doesn t have access to all data Encoders: u 1 u 2 u k v 1 v 2 v n c 1 =ug 1 c 2 =ug 2 c n =ug n G RS g 1 g 2 g n
18 Distributed RS Encoding Doesn t have access to all data Encoders: u 1 u 2 u k v 1 v 2 v n G c 1 =ug 1 c 2 =ug 2 c n =ug n g1 g 2 gn RS
19 Distributed RS Encoding Doesn t have access to all data Encoders: u 1 u 2 u k v 1 v 2 v n G c 1 =ug 1 c 2 =ug 2 c n =ug n Is there any generator matrix g1 for the RS code with the g 2 given constraints? gn RS
20 Simple multiple access network r s s 1 s 2 s s r s r s v 1 v 2 v n W. Halbawi, T. Ho, H. Yao and I. Duursma, Distributed codes for simple multiple access network, arxiv: v1, 213. D
21 Simple multiple access network r s s 1 s 2 s s r s r s v 1 v 2 v n z errors At most z relays are compromised by adversaries. D
22 Simple multiple access network r s s 1 s 2 s s r s r s v 1 v 2 v n z errors D At most z relays are compromised by adversaries. If relay nodes encode a RS[n, k, d=2z+1] code, then destination can recover the data.
23 Constrained MDS generator matrices MDS matrix completion problem: Assume M is a binary n k matrix that satisfy no rectangle condition (it has no all-zero submatrix of total dimension exceeding k). Is there exist an MDS completion for M, i.e. replacing 1 s in M by elements of F q such that the constructed matrix generates an MDS code? Balanced sparsest generator matrix for MDS codes: Constructing a generator matrix, M, for an MDS code such that each row of M has weight n-k+1 and column weights of M differ from each other by at most one. Weakly secure cooperative data exchange problem A group of wireless clients have access to different subsets of n packets and the like to exchange the packets over a lossless broadcast channel secuirly.
24 Related works [Yao, Ho, Nita-Rotaru 11] Key agreement for wireless network in the presence of active adversaries [Halbawi, Ho, Yao, Duursma 13] Distributed Reed-Solomon codes for simple multiple access networks [Dau, Song, Dong, Yuen 13] Balanced sparsest generator matrices for MDS codes [El Rouayheb, Sprintson, Sadeghi 1] On coding for cooperative data exchange [Dau, Song, Sprintson, Yuen 15] Constructions of MDS codes via random Vandermonde and Cauchy matrices over small fields [Dau, Song, Yuen 14]On the existence of MDS codes over small fields with constrained generator matrices [Yan, Sprintson 13] Algorithms for weakly secure data exchange [W. Halbawi, M. Thill and B. Hassibi] Coding with constraints: Minimum distance bounds and systematic constructions [W. Halbawi, Z. Liu and B. Hassibi] Balanced Reed-Solomon codes
25 Distributed RS Encoding u 12 u 13 u 21 u 11 u 22 u k1 u k2 u k3 v 1 v 2 v n G c 1 =ug 1 c 2 =ug 2 c n =ug n Is there any generator matrix g1 for the RS code with the g 2 given constraints? gn RS
26 Distributed RS Encoding u 12 u 13 u 21 u 11 u 22 u k1 u k2 u k3 v 1 v 2 v n G c 1 =ug 1 c 2 =ug 2 c n =ug n Is there any generator matrix g1 for the RS code with the g 2 given constraints? gn RS
27 Distributed RS Encoding r s u 12 u 13 u 21 u 11 u 22 u k1 u k2 u k3 v 1 v 2 v n G c 1 =ug 1 c 2 =ug 2 c n =ug n Is there any generator matrix g1 for the RS code with the g 2 given constraints? gn RS
28 Distributed RS Encoding r s s 1 s 2 s s r2 r s r s v 1 v 2 v n G c 1 =ug 1 c 2 =ug 2 c n =ug n Is there any generator matrix g1 for the RS code with the g 2 given constraints? gn RS
29 Example: Three sources s 1 s 2 s 3 v 1 v 2 v n c 1 =ug 1 c 2 =ug 2 c n =ug n GRS n 1 n 2 n 3 n 12 n 13 n 23 n 123 Z 1 ={positions of zeros of the first group} Z 2 ={positions of zeros of the second group} Z 3 ={positions of zeros of the third group}
30 Simple multiple access network r s s 1 s 2 s s r s r s v 1 v 2 v n W. Halbawi, T. Ho, H. Yao and I. Duursma, Distributed codes for simple multiple access network, arxiv: v1, 213. D
31 Necessary condition (network coding) Network s 1 z links in error s 2 D s s We can only hope to find a distributed RS code for rates (,,, r s ) in the capacity region of the network.
32 Network error correction N. Cai and R. W. Yeung (26) Single source multicast networks D. Silva, F. R. Kschischang, and R. Koetter (28) Rank-metric codes S. Mohajer, M. Jafari, S. Diggavi, and C. Fragouli (29) Two source multicast networks T. Dikaliotis, T. Ho, S. Jaggi, S. Vyetrenko, H. Yao, M. Effros, J. Kliewer, and E. Erez (211) Multisource multicast networks X. Guang and Z. Zhang (214) Linear network error correction coding
33 Network error correction Network s 1 z links in error s 2 D s s Capacity region: i I(S ) r i C S 2z, S S T. Dikaliotis, T. Ho, S. Jaggi, S. Vyetrenko, H. Yao, M. Effros, J. Kliewer, and E. Erez, Multiple access network information-flow and correction codes, IEEE IT, 57(2), 211.
34 Network error correction Network s 1 z links in error s 2 D s s Min-cut capacity between S and D Capacity region: i I(S ) r i C S 2z, S S T. Dikaliotis, T. Ho, S. Jaggi, S. Vyetrenko, H. Yao, M. Effros, J. Kliewer, and E. Erez, Multiple access network information-flow and correction codes, IEEE IT, 57(2), 211.
35 Network error correction Network s 1 z links in error s 2 D s s Min-cut capacity between S and D Capacity region: i I(S ) r i C S 2z, S S Computationally efficient linear network codes with decoding success probability of at least 1- s E /p and complexity O(l m S ) T. Dikaliotis, T. Ho, S. Jaggi, S. Vyetrenko, H. Yao, M. Effros, J. Kliewer, and E. Erez, Multiple access network information-flow and correction codes, IEEE IT, 57(2), 211.
36 Network error correction Network s 1 z links in error s 2 D s s Min-cut capacity between S and D Capacity region: i I(S ) r i C S 2z, S S Exponential in S Computationally efficient linear network codes with decoding success probability of at least 1- s E /p and complexity O(l m S ) T. Dikaliotis, T. Ho, S. Jaggi, S. Vyetrenko, H. Yao, M. Effros, J. Kliewer, and E. Erez, Multiple access network information-flow and correction codes, IEEE IT, 57(2), 211.
37 Necessary condition (network coding) r s s 1 s 2 s s v 1 v 2 v n D Min-cut capacity between S and D Necessary condition: i I(S ) r i C S 2z, S S T. Dikaliotis, T. Ho, S. Jaggi, S. Vyetrenko, H. Yao, M. Effros, J. Kliewer, and E. Erez, Multiple access network information-flow and correction codes, IEEE IT, 57(2), 211.
38 Necessary condition (three sources) GRS n 1 n 2 n 3 n 12 n 13 n 23 n 123 Z 1 ={positions of zeros of the first group} Z 2 ={positions of zeros of the second group} Z 3 ={positions of zeros of the third group} Capacity region: r i k Z i, i {1,2,3} r i + r j k Z i Z j, i, j + + k {1,2,3}
39 Necessary condition (three sources) GRS n 1 n 2 n 3 n 12 n 13 n 23 n 123 Z 1 ={positions of zeros of the first group} Z 2 ={positions of zeros of the second group} Z 3 ={positions of zeros of the third group} Capacity region: r i k Z i, i {1,2,3} r i + r j k Z i Z j, i, j + + k {1,2,3}
40 Necessary condition (three sources) GRS n 1 n 2 n 3 n 12 n 13 n 23 n 123 Z 1 ={positions of zeros of the first group} Z 2 ={positions of zeros of the second group} Z 3 ={positions of zeros of the third group} Capacity region: r i k Z i, i {1,2,3} r i + r j k Z i Z j, i, j + + k {1,2,3}
41 Necessary conditions (three sources) GRS n 1 n 2 n 3 n 12 n 13 n 23 n 123 Z 1 ={positions of zeros of the first group} Z 2 ={positions of zeros of the second group} Z 3 ={positions of zeros of the third group} Capacity region: r i k Z i, i {1,2,3} r i + r j k Z i Z j, i, j + + k {1,2,3} If rates are inside the capacity region, Halbawi et al. (214) showed that for up to three sources one can always find G RS.
42 Necessary conditions (three sources) GRS n 1 n 2 n 3 n 12 n 13 n 23 n 123 Z 1 ={positions of zeros of the first group} We are going to show that for any number of sources if rates are inside the capacity region of SMAN, one can always construct the Z 2 ={positions of zeros of the second group} Z 3 ={positions of zeros of the third group} Capacity region: generator matrix r i k GZ i, i {1,2,3} RS for the distributed RS code over r i + a rfinite j k field Z i of Z j size, i, j at {1,2,3} least n. + + k If rates are inside the capacity region, Halbawi et al. (214) showed that for up to three sources one can always find G RS.
43 Proof (by induction on # sources) The result holds for the case of two sources We assume that the result holds for the case of having less than s sources. We show that it holds for the case of s sources Constraints for the case of s sources: k Z 1 k Z 2 r s k Z s r i1 + r i2 + + r il k Z i1 Z i 2 Z il r s k
44 When rates are inside the boundaries All the constraints are not tight. Constraints for the case of s sources: < k Z 1 < k Z 2 r s < k Z s r i1 + r i2 + + r il < k Z i1 Z i 2 Z il r s < k
45 Rates inside the boundaries All the constraints are not tight. Constraints for the case of s sources: < k Z 1 < k Z 2 r s < k Z s r i1 + r i2 + + r il < k Z i1 Z i 2 Z il r s k Increase r i s till we hit the boundaries
46 Rates inside the boundaries All the constraints are not tight. Constraints for the case of s sources: < k Z 1 < k Z 2 r s < k Z s r i1 + r i2 + + r il < k Z i1 Z i 2 Z il r s k Increase r i s till we hit the boundaries Notice: If we construct G RS for the new rates, then by removing some rows of G RS, we can construct G RS for the original rates.
47 Rates on the boundary = k Z 1 = k Z r s = k l 2 l < s i: r i < k Z i r i1 + + r il = k Z i1 Z i l r s = k Z s r i1 + + r il < k Z i1 Z i l Case I Case II Case III
48 Rates on the boundary (Case III) Constraints: k Z 1 i: r i < k Z i r s k Z s r i1 + r i2 + + r il < k Z i1 Z i 2 Z il r s = k
49 Rates on the boundary (Case III) Constraints: k Z 1 i: r i < k Z i r s k Z s r i1 + r i2 + + r il < k Z i1 Z i 2 Z il r s = k GRS
50 Rates on the boundary (Case III) Constraints: k Z 1 i: r i < k Z i r s k Z s r i1 + r i2 + + r il < k Z i1 Z i 2 Z il r s = k We can always add a column of all zeros to the i-th group of G RS without violating the constraints. GRS
51 Rates on the boundary (Case III) Constraints: k Z 1 i: r i < k Z i r s k Z s r i1 + r i2 + + r il < k Z i1 Z i 2 Z il r s = k We can always add a column of all zeros to the i-th group of G RS without violating the constraints. GRS
52 Rates on the boundary (Case III) Constraints: k Z 1 r i k ( Z i + 1) r s k Z s r i1 + r i2 + + r il k ( Z i1 Z i 2 Z il + 1) r s = k We can always add a column of all zeros to the i-th group of G RS without violating the constraints. GRS
53 Rates on the boundary (Case III) Constraints: k Z 1 r i k ( Z i + 1) r s k Z s r i1 + r i2 + + r il k ( Z i1 Z i 2 Z il + 1) r s = k We can always add a column of all zeros to the i-th group of G RS without violating the constraints. GRS Keep adding zero columns until a set of inequalities becomes tight.
54 Rates on the boundary (Case III) Case III By inserting zeros in the generator matrix Case I Case II
55 Rates on the boundary (Case II) Constraints: k Z 1 r i k Z i r s k Z s r i1 + r i2 + + r il = k Z i1 Z i 2 Z il r s k GRS
56 Rates on the boundary (Case II) Constraints: k Z 1 r i k Z i r s k Z s r i1 + r i2 + + r il = k Z i1 Z i 2 Z il r s k GRS
57 Rates on the boundary (Case II) GRS + = k Z 1 Z 2
58 (1) G RS Rates on the boundary (Case II) GRS k Z 1 k Z 2 Create two new problems Problem 1: Problem 2: + = k Z 1 Z 2 G 2 (2) RS + = k Z 1 Z 2 = 2 = k Z 12 k Z 3 = 2 Z k Z 12 Z 3
59 (1) G RS Rates on the boundary (Case II) GRS Problem 1: Problem 2: k Z 1 k Z 2 + = k Z 1 Z 2 G 2 (2) RS + = k Z 1 Z 2 = 2 = k Z 12 k Z 3 = 2 Z 12 Notice: These subspaces are identical. 2 + k Z 12 Z 3
60 (1) G RS Rates on the boundary (Case II) GRS Problem 1: Problem 2: k Z 1 k Z 2 + = k Z 1 Z 2 G 2 (2) RS By induction, we can solve the sub-problems + = k Z 1 Z 2 = 2 = k Z 12 k Z 3 = 2 Z 12 Notice: These subspaces are identical. 2 + k Z 12 Z 3
61 Rates on the boundary (Case I) Constraints: = k Z 1 r i = k Z i r s = k Z s r i1 + r i2 + + r il k Z i1 Z i 2 Z il r s k
62 Case I: Example Consider we are looking for a distributed RS code with length n=6 and dimension k=3 such that = = =1 and the generator matrix has the following form: Evaluation points: G RS = α 1 α 2 α 3 α 4 α 5 α 6 So r i = k Z i = 3 2 = 1, r i + r j 3, + + 3
63 Case I: Example Consider we are looking for a distributed RS code with length n=6 and dimension k=3 such that = = =1 and the generator matrix has the following form: Evaluation points: G RS = α 1 α 2 α 3 α 4 α 5 α 6 So r i = k Z i = 3 2 = 1, r i + r j 3, General form of RS codewords from the first two rows: c 12 x = f x α 5 x α 6 + g (x α 3 )(x α 4 )
64 Case I: Example Consider we are looking for a distributed RS code with length n=6 and dimension k=3 such that = = =1 and the generator matrix has the following form: Evaluation points: G RS = α 1 α 2 α 3 α 4 α 5 α 6 So r i = k Z i = 3 2 = 1, r i + r j 3, General form of RS codewords from the first two rows: c 12 x = f x α 5 x α 6 + g (x α 3 )(x α 4 )
65 Case I: Example Consider we are looking for a distributed RS code with length n=6 and dimension k=3 such that = = =1 and the generator matrix has the following form: Evaluation points: G RS = α 1 α 2 α 3 α 4 α 5 α 6 So r i = k Z i = 3 2 = 1, r i + r j 3, General form of RS codewords from the first two rows: c 12 x = f x α 5 x α 6 + g (x α 3 )(x α 4 ) If α 1 α 5 α 1 α 6 (α 2 α 5 )(α 2 α 6 ) = α 1 α 3 α 1 α 4 f, g : c 12 α 1 = c 12 α 2 = (α 2 α 3 )(α 3 α 4 )
66 Case I: Example Consider we are looking for a distributed RS code with length n=6 and dimension k=3 such that = = =1 and the generator matrix has the following form: Evaluation points: G RS = So α 1 α 2 α 3 α 4 α 5 α 6 The generator matrix r i = k Z i = 3 2 = 1, r i + r j 3, General form of RS codewords from the first two rows: c 12 x = f x α 5 x α 6 + g (x α 3 )(x α 4 ) is not full rank! If α 1 α 5 α 1 α 6 (α 2 α 5 )(α 2 α 6 ) = α 1 α 3 α 1 α 4 f, g : c 12 α 1 = c 12 α 2 = (α 2 α 3 )(α 3 α 4 )
67 Case I: Example Consider we are looking for a distributed RS code with length n=6 and dimension k=3 such that = = =1 and the generator matrix has the following form: Evaluation points: G RS = α 1 α 2 α 3 α 4 α 5 α 6 To have a counterexample, So evaluation points should satisfy General form specific of RS constraints! codewords from the first two rows: r i = k Z i = 3 2 = 1, r i + r j 3, c 12 x = f x α 5 x α 6 + g (x α 3 )(x α 4 ) The generator matrix is not full rank! If α 1 α 5 α 1 α 6 (α 2 α 5 )(α 2 α 6 ) = α 1 α 3 α 1 α 4 f, g : c 12 α 1 = c 12 α 2 = (α 2 α 3 )(α 3 α 4 )
68 Case I: Example Consider we are looking for a distributed RS code with length n=6 and dimension k=3 such that = = =1 and the generator matrix has the following form: Evaluation points: G RS = α 1 α 2 α 3 α 4 α 5 α 6 Choose evaluation points of the distributed RS code carefully. To have a counterexample, So evaluation points should satisfy General form specific of RS constraints! codewords from the first two rows: r i = k Z i = 3 2 = 1, r i + r j 3, c 12 x = f x α 5 x α 6 + g (x α 3 )(x α 4 ) The generator matrix is not full rank! If α 1 α 5 α 1 α 6 (α 2 α 5 )(α 2 α 6 ) = α 1 α 3 α 1 α 4 f, g : c 12 α 1 = c 12 α 2 = (α 2 α 3 )(α 3 α 4 )
69 Rates on the boundary (Case I) Constraints: = k Z 1 r i = k Z i r s = k Z s GRS Theorem: There is always a set of evaluation points such that one can construct a full rank generator matrix in case I.
70 Rates on the boundary (Case I) Theorem: There is always a set of evaluation points such that one can construct a full rank generator matrix in case I. Proof by induction: GRS P 1 x = P 2 x = i Z 1 (x α i ) i Z 2 (x α i ) c 1 x = f x P 1 (x) deg f x 1 c 2 x = g x P 2 (x) deg g x 1
71 Rates on the boundary (Case I) Theorem: There is always a set of evaluation points such that one can construct a full rank generator matrix in case I. Proof by induction: GRS α i1,, α Z3 Z 3 Z 3 P 1 (α i 1 ) α 1 P1 (α i1 i 1 ) P 1 (α i Z 3 ) α 1 i P1 Z3 (α i ) Z 3 P 1 x = P 2 x = i Z 1 (x α i ) i Z 2 (x α i ) P 2 (α i 1 ) α 1 P2 (α i1 i 1 ) P 2 (α i Z 3 ) α 1 i P2 Z3 (α i Z 3 ) c 1 x = f x P 1 (x) deg f x 1 c 2 x = g x P 2 (x) deg g x 1 f f r1 1 g g r2 1 =
72 Rates on the boundary (Case I) Theorem: There is always a set of evaluation points such that one can always construct a full rank generator matrix in case I. Z 3 Proof by induction: P 1 (α i 1 ) α 1 P1 (α i1 i 1 ) P 1 (α i Z 3 ) α 1 i P1 Z3 (α i ) Z k, = k Z 3 Z 3 + P 2 (α i 1 ) α 1 P2 (α i1 i 1 ) P 2 (α i Z 3 ) α 1 i P2 Z3 (α i Z 3 ) f f r1 1 g g r2 1 =
73 Rates on the boundary (Case I) Theorem: There is always a set of evaluation points such that one can construct a full rank generator matrix in case I. Z 3 Proof by induction: P 1 (α i 1 ) α 1 P1 (α i1 i 1 ) P 1 (α i Z 3 ) α 1 i P1 Z3 (α i ) Z k, = k Z 3 Z 3 + P 2 (α i 1 ) α 1 P2 (α i1 i 1 ) P 2 (α i Z 3 ) α 1 i P2 Z3 (α i Z 3 ) f f r1 1 g g r2 1 = M r1 + + = P 1 (y 1 ) r y P1 (y 1 ) P 1 (y r1 + ) r y 1 1 r1 +r P1 2 (y r1 + ) P 2 (y 1 ) r y P2 (y 1 ) P 2 (y r1 + ) r y 2 1 r1 +r P2 2 (y r1 + )
74 Rates on the boundary (Case I) Theorem: There is always a set of evaluation points such that one can construct a full rank generator matrix in case I. Z 3 Proof by induction: P 1 (α i 1 ) α 1 P1 (α i1 i 1 ) P 1 (α i Z 3 ) α 1 i P1 Z3 (α i ) Z k, = k Z 3 Z 3 + P 2 (α i 1 ) α 1 P2 (α i1 i 1 ) P 2 (α i Z 3 ) α 1 i P2 Z3 (α i Z 3 ) f f r1 1 g g r2 1 = M r1 + + = P 1 (y 1 ) r y P1 (y 1 ) P 1 (y r1 + ) r y 1 1 r1 +r P1 2 (y r1 + ) P 2 (y 1 ) r y P2 (y 1 ) P 2 (y r1 + ) r y 2 1 r1 +r P2 2 (y r1 + ) By induction α 1,, α r1 + : det M α 1,, α r1 + det M y 1,, y r1 +
75 Rates on the boundary (Case I) Theorem: There is always a set of evaluation points such that one can construct a full rank generator matrix in case I. Z 3 Proof by induction: P 1 (α i 1 ) α 1 P1 (α i1 i 1 ) P 1 (α i Z 3 ) α 1 i P1 Z3 (α i ) Z k, = k Z 3 Z 3 + P 2 (α i 1 ) α 1 P2 (α i1 i 1 ) P 2 (α i Z 3 ) α 1 i P2 Z3 (α i Z 3 ) f f r1 1 g g r2 1 = M r1 + + = P 1 (y 1 ) r y P1 (y 1 ) P 1 (y r1 + ) r y 1 1 r1 +r P1 2 (y r1 + ) P 2 (y 1 ) r y P2 (y 1 ) P 2 (y r1 + ) r y 2 1 r1 +r P2 2 (y r1 + ) By induction α 1,, α r1 + : det M α 1,, α r1 + det M y 1,, y r1 + Choose α i1,, α i Z 3 such that det M α i 1,, α ir 1+r2
76 Rates on the boundary (Case I) + + r l f n P 1 (y 1 ) r y P1 (y 1 ) P 1 (y n ) r y 1 1 n P1 (y n ) P 2 (y 1 ) r y P2 (y 1 ) P 2 (y n ) r y 2 1 n P2 (y n ) f r1 1 g g r2 1 = c 1 c n
77 Rates on the boundary (Case I) n M + + r l P 1 (y 1 ) r y P1 (y 1 ) P 1 (y n ) r y 1 1 n P1 (y n ) P 2 (y 1 ) r y P2 (y 1 ) P 2 (y n ) r y 2 1 n P2 (y n ) We just showed that there exist a matrix M such that det M = h y 1,, y n f f r1 1 g g r2 1 = c 1 c n
78 Rates on the boundary (Case I) n M + + r l P 1 (y 1 ) r y P1 (y 1 ) P 1 (y n ) r y 1 1 n P1 (y n ) P 2 (y 1 ) r y P2 (y 1 ) P 2 (y n ) r y 2 1 n P2 (y n ) We just showed that there exist a matrix M such that det M = h y 1,, y n choose evaluation points (α 1,, α n ) such that h α 1,, α n f f r1 1 g g r2 1 = c 1 c n
79 Induction Case II Case II Case II Case II Case II Case II Case II Case II
80 Induction Case II Case II Case II Case II Case II Case II M 1 Case II M 3 Case II M 2 M l
81 Induction Case II Case II choose evaluation points α 1, α 2,, α n Case II such that Case II Case II det M 1 det M 2 det M l α1,,α n Case II M 1 Case II M 3 Case II M 2 M l
82 Size of the required finite-field G RS = f 1 α 1 P 1 (α 1 ) f r1 α 1 P 1 (α 1 ) g 1 α 1 P 2 (α 1 ) g r2 α 1 P 2 (α 1 ) n f 1 α n P 1 (α n ) f r1 α n P 1 (α n ) g 1 α n P 2 (α n ) g r2 α n P 2 (α n )
83 Size of the required finite-field G RS = f 1 α 1 P 1 (α 1 ) f r1 α 1 P 1 (α 1 ) g 1 α 1 P 2 (α 1 ) g r2 α 1 P 2 (α 1 ) Choose evaluation points such that: n f 1 α n P 1 (α n ) f r1 α n P 1 (α n ) g 1 α n P 2 (α n ) g r2 α n P 2 (α n ) M (r1 + +r s ) ( + +r s ) det M Full rank deg det M k k 1, max i deg α i k 1 Extended Schwartz-Zippel Lemma: If size of the finite-field is larger than or equal to n, then there are sets of evaluation points that satisfy the inequality.
84 Future work We can construct a randomized algorithm that finds G RS. Find an efficient determinist algorithm for the problem. Extend the results to general multiple-source networks (Gabidulin codes) Look for applications in storage systems
Weakly 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 informationCoding with Constraints: Different Flavors
Coding with Constraints: Different Flavors Hoang Dau 1 University of Illinois at Urbana-Champaign Email: hoangdau@uiuc.edu DIMACS Workshop on Network Coding: the Next 15 Years Rutgers University, NJ, 2015
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 informationMultiple Access Network Information-flow And Correction codes
Multiple Access Network Information-flow And Correction codes Hongyi Yao 1, Theodoros K. Dikaliotis, Sidharth Jaggi, Tracey Ho 1 Tsinghua University California Institute of Technology Chinese University
More informationAn Introduction to (Network) Coding Theory
An to (Network) Anna-Lena Horlemann-Trautmann University of St. Gallen, Switzerland April 24th, 2018 Outline 1 Reed-Solomon Codes 2 Network Gabidulin Codes 3 Summary and Outlook A little bit of history
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 informationAn Introduction to (Network) Coding Theory
An Introduction to (Network) Coding Theory Anna-Lena Horlemann-Trautmann University of St. Gallen, Switzerland July 12th, 2018 1 Coding Theory Introduction Reed-Solomon codes 2 Introduction Coherent 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 informationSecure RAID Schemes from EVENODD and STAR Codes
Secure RAID Schemes from EVENODD and STAR Codes Wentao Huang and Jehoshua Bruck California Institute of Technology, Pasadena, USA {whuang,bruck}@caltechedu Abstract We study secure RAID, ie, low-complexity
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 informationBerlekamp-Massey decoding of RS code
IERG60 Coding for Distributed Storage Systems Lecture - 05//06 Berlekamp-Massey decoding of RS code Lecturer: Kenneth Shum Scribe: Bowen Zhang Berlekamp-Massey algorithm We recall some notations from lecture
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 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 informationDistributed Decoding of Convolutional Network Error Correction Codes
1 Distributed Decoding of Convolutional Network Error Correction Codes Hengjie Yang and Wangmei Guo arxiv:1701.06283v2 [cs.it] 18 Feb 2017 Abstract A Viterbi-like decoding algorithm is proposed in this
More informationOptimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction K V Rashmi, Nihar B Shah, and P Vijay Kumar, Fellow, IEEE Abstract Regenerating codes
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 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 informationLayered Error-Correction Codes for Real-Time Streaming over Erasure Channels
Layered Error-Correction Codes for Real-Time Streaming over Erasure Channels Ashish Khisti University of Toronto Joint Work: Ahmed Badr (Toronto), Wai-Tian Tan (Cisco), John Apostolopoulos (Cisco). Sequential
More informationGuess & Check Codes for Deletions, Insertions, and Synchronization
Guess & Check Codes for Deletions, Insertions, and Synchronization Serge Kas Hanna, Salim El Rouayheb ECE Department, Rutgers University sergekhanna@rutgersedu, salimelrouayheb@rutgersedu arxiv:759569v3
More informationOn Randomized Network Coding
On Randomized Network Coding Tracey Ho, Muriel Médard, Jun Shi, Michelle Effros and David R. Karger Massachusetts Institute of Technology, University of California, Los Angeles, California Institute of
More information5.0 BCH and Reed-Solomon Codes 5.1 Introduction
5.0 BCH and Reed-Solomon Codes 5.1 Introduction A. Hocquenghem (1959), Codes correcteur d erreurs; Bose and Ray-Chaudhuri (1960), Error Correcting Binary Group Codes; First general family of algebraic
More informationError-correcting codes and applications
Error-correcting codes and applications November 20, 2017 Summary and notation Consider F q : a finite field (if q = 2, then F q are the binary numbers), V = V(F q,n): a vector space over F q of dimension
More information6.895 PCP and Hardness of Approximation MIT, Fall Lecture 3: Coding Theory
6895 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 3: Coding Theory Lecturer: Dana Moshkovitz Scribe: Michael Forbes and Dana Moshkovitz 1 Motivation In the course we will make heavy use of
More informationCoding for loss tolerant systems
Coding for loss tolerant systems Workshop APRETAF, 22 janvier 2009 Mathieu Cunche, Vincent Roca INRIA, équipe Planète INRIA Rhône-Alpes Mathieu Cunche, Vincent Roca The erasure channel Erasure codes Reed-Solomon
More informationLinear Programming Bounds for Robust Locally Repairable Storage Codes
Linear Programming Bounds for Robust Locally Repairable Storage Codes M. Ali Tebbi, Terence H. Chan, Chi Wan Sung Institute for Telecommunications Research, University of South Australia Email: {ali.tebbi,
More information: Error Correcting Codes. October 2017 Lecture 1
03683072: Error Correcting Codes. October 2017 Lecture 1 First Definitions and Basic Codes Amnon Ta-Shma and Dean Doron 1 Error Correcting Codes Basics Definition 1. An (n, K, d) q code is a subset of
More informationContinuous-Model Communication Complexity with Application in Distributed Resource Allocation in Wireless Ad hoc Networks
Continuous-Model Communication Complexity with Application in Distributed Resource Allocation in Wireless Ad hoc Networks Husheng Li 1 and Huaiyu Dai 2 1 Department of Electrical Engineering and Computer
More informationGuess & Check Codes for Deletions, Insertions, and Synchronization
Guess & Chec Codes for Deletions, Insertions, and Synchronization Serge Kas Hanna, Salim El Rouayheb ECE Department, IIT, Chicago sashann@hawiitedu, salim@iitedu Abstract We consider the problem of constructing
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 informationLow Complexity Encoding for Network Codes
Low Complexity Encoding for Network Codes Sidharth Jaggi 1 Laboratory of Information and Decision Sciences Massachusetts Institute of Technology Cambridge, MA 02139, USA Email: jaggi@mit.edu Yuval Cassuto
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 informationSection 3 Error Correcting Codes (ECC): Fundamentals
Section 3 Error Correcting Codes (ECC): Fundamentals Communication systems and channel models Definition and examples of ECCs Distance For the contents relevant to distance, Lin & Xing s book, Chapter
More informationCorrecting Localized Deletions Using Guess & Check Codes
55th Annual Allerton Conference on Communication, Control, and Computing Correcting Localized Deletions Using Guess & Check Codes Salim El Rouayheb Rutgers University Joint work with Serge Kas Hanna and
More informationNetwork Codes Resilient to Jamming and Eavesdropping
Network Codes Resilient to Jamming and Eavesdropping Hongyi Yao Danilo Silva Sidharth Jaggi Michael Langberg Tsinghua University State University of Campinas Chinese University of Hong Kong The Open University
More informationOn the Capacity of Secure Network Coding
On the Capacity of Secure Network Coding Jon Feldman Dept. of IEOR Tal Malkin Dept. of CS Rocco A. Servedio Dept. of CS Columbia University, New York, NY {jonfeld@ieor, tal@cs, rocco@cs, cliff@ieor}.columbia.edu
More informationGroup Secret Key Agreement over State-Dependent Wireless Broadcast Channels
Group Secret Key Agreement over State-Dependent Wireless Broadcast Channels Mahdi Jafari Siavoshani Sharif University of Technology, Iran Shaunak Mishra, Suhas Diggavi, Christina Fragouli Institute of
More informationCommunication Efficient Secret Sharing
Communication Efficient Secret Sharing 1 Wentao Huang, Michael Langberg, senior member, IEEE, Joerg Kliewer, senior member, IEEE, and Jehoshua Bruck, Fellow, IEEE arxiv:1505.07515v2 [cs.it] 1 Apr 2016
More informationError-Correcting Codes for Networks, Storage and Computation
Error-Correcting Codes for Networks, Storage and Computation Thesis by Wael Halbawi In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy CALIFORNIA INSTITUTE OF TECHNOLOGY
More informationProduct-matrix Construction
IERG60 Coding for Distributed Storage Systems Lecture 0-9//06 Lecturer: Kenneth Shum Product-matrix Construction Scribe: Xishi Wang In previous lectures, we have discussed about the minimum storage regenerating
More informationMATH Examination for the Module MATH-3152 (May 2009) Coding Theory. Time allowed: 2 hours. S = q
MATH-315201 This question paper consists of 6 printed pages, each of which is identified by the reference MATH-3152 Only approved basic scientific calculators may be used. c UNIVERSITY OF LEEDS Examination
More informationGabidulin Codes that are Generalized. Reed Solomon Codes
International Journal of Algebra, Vol. 4, 200, no. 3, 9-42 Gabidulin Codes that are Generalized Reed Solomon Codes R. F. Babindamana and C. T. Gueye Departement de Mathematiques et Informatique Faculte
More informationLecture 3: Error Correcting Codes
CS 880: Pseudorandomness and Derandomization 1/30/2013 Lecture 3: Error Correcting Codes Instructors: Holger Dell and Dieter van Melkebeek Scribe: Xi Wu In this lecture we review some background on error
More informationIN this paper, we will introduce a new class of codes,
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 44, NO 5, SEPTEMBER 1998 1861 Subspace Subcodes of Reed Solomon Codes Masayuki Hattori, Member, IEEE, Robert J McEliece, Fellow, IEEE, and Gustave Solomon,
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 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 informationQuasi-cyclic Low Density Parity Check codes with high girth
Quasi-cyclic Low Density Parity Check codes with high girth, a work with Marta Rossi, Richard Bresnan, Massimilliano Sala Summer Doctoral School 2009 Groebner bases, Geometric codes and Order Domains Dept
More informationByzantine Modification Detection in Multicast Networks with Random Network Coding
Byzantine Modification Detection in Multicast Networks with Random Network Coding Tracey Ho, Ben Leong, Ralf Koetter, Muriel Médard, Michelle Effros, and David R. Karger Abstract This paper gives an information
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 informationRegenerating Codes and Locally Recoverable. Codes for Distributed Storage Systems
Regenerating Codes and Locally Recoverable 1 Codes for Distributed Storage Systems Yongjune Kim and Yaoqing Yang Abstract We survey the recent results on applying error control coding to distributed storage
More informationNetwork Coding and Schubert Varieties over Finite Fields
Network Coding and Schubert Varieties over Finite Fields Anna-Lena Horlemann-Trautmann Algorithmics Laboratory, EPFL, Schweiz October 12th, 2016 University of Kentucky What is this talk about? 1 / 31 Overview
More informationEquivalence for Networks with Adversarial State
Equivalence for Networks with Adversarial State Oliver Kosut Department of Electrical, Computer and Energy Engineering Arizona State University Tempe, AZ 85287 Email: okosut@asu.edu Jörg Kliewer Department
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 informationConvolutional Codes with Maximum Column Sum Rank for Network Streaming
1 Convolutional Codes with Maximum Column Sum Rank for Network Streaming Rafid Mahmood, Ahmed Badr, and Ashish Khisti School of Electrical and Computer Engineering University of Toronto Toronto, ON, M5S
More informationMATH32031: Coding Theory Part 15: Summary
MATH32031: Coding Theory Part 15: Summary 1 The initial problem The main goal of coding theory is to develop techniques which permit the detection of errors in the transmission of information and, if necessary,
More informationRack-Aware Regenerating Codes for Data Centers
IEEE TRANSACTIONS ON INFORMATION THEORY 1 Rack-Aware Regenerating Codes for Data Centers Hanxu Hou, Patrick P. C. Lee, Kenneth W. Shum and Yuchong Hu arxiv:1802.04031v1 [cs.it] 12 Feb 2018 Abstract Erasure
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 informationInteractive Interference Alignment
Interactive Interference Alignment Quan Geng, Sreeram annan, and Pramod Viswanath Coordinated Science Laboratory and Dept. of ECE University of Illinois, Urbana-Champaign, IL 61801 Email: {geng5, kannan1,
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 informationArrangements, matroids and codes
Arrangements, matroids and codes first lecture Ruud Pellikaan joint work with Relinde Jurrius ACAGM summer school Leuven Belgium, 18 July 2011 References 2/43 1. Codes, arrangements and matroids by Relinde
More informationMATH 291T CODING THEORY
California State University, Fresno MATH 291T CODING THEORY Fall 2011 Instructor : Stefaan Delcroix Contents 1 Introduction to Error-Correcting Codes 3 2 Basic Concepts and Properties 6 2.1 Definitions....................................
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 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 informationApproximating the Gaussian multiple description rate region under symmetric distortion constraints
Approximating the Gaussian multiple description rate region under symmetric distortion constraints Chao Tian AT&T Labs-Research Florham Park, NJ 0793, USA. tian@research.att.com Soheil Mohajer Suhas Diggavi
More informationDecoding Reed-Muller codes over product sets
Rutgers University May 30, 2016 Overview Error-correcting codes 1 Error-correcting codes Motivation 2 Reed-Solomon codes Reed-Muller codes 3 Error-correcting codes Motivation Goal: Send a message Don t
More informationGraph-based Codes for Quantize-Map-and-Forward Relaying
20 IEEE Information Theory Workshop Graph-based Codes for Quantize-Map-and-Forward Relaying Ayan Sengupta, Siddhartha Brahma, Ayfer Özgür, Christina Fragouli and Suhas Diggavi EPFL, Switzerland, UCLA,
More informationChapter 6 Lagrange Codes
Chapter 6 Lagrange Codes 6. Introduction Joseph Louis Lagrange was a famous eighteenth century Italian mathematician [] credited with minimum degree polynomial interpolation amongst his many other achievements.
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 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 Equivalency of Reliability and Security Metrics for Wireline Networks
On the Equivalency of Reliability and Security Metrics for Wireline Networks Mohammad Mahdi Mojahedian, Amin Gohari and Mohammad Reza Aref arxiv:1609.04586v1 [cs.it] 15 Sep 2016 Information Systems and
More informationAn Introduction to Low Density Parity Check (LDPC) Codes
An Introduction to Low Density Parity Check (LDPC) Codes Jian Sun jian@csee.wvu.edu Wireless Communication Research Laboratory Lane Dept. of Comp. Sci. and Elec. Engr. West Virginia University June 3,
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 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 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 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 informationLecture 19 : Reed-Muller, Concatenation Codes & Decoding problem
IITM-CS6845: Theory Toolkit February 08, 2012 Lecture 19 : Reed-Muller, Concatenation Codes & Decoding problem Lecturer: Jayalal Sarma Scribe: Dinesh K Theme: Error correcting codes In the previous lecture,
More informationA Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes
A Piggybacing Design Framewor for Read-and Download-efficient Distributed Storage Codes K V Rashmi, Nihar B Shah, Kannan Ramchandran, Fellow, IEEE Department of Electrical Engineering and Computer Sciences
More informationLinear Block Codes. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 26 Linear Block Codes Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay July 28, 2014 Binary Block Codes 3 / 26 Let F 2 be the set
More informationThe Impact of Network Coding on Mathematics
The Impact of Network Coding on Mathematics Eimear Byrne University College Dublin DIMACS Workshop on Network Coding: the Next 15 Years Dec 15-17, 2015 Random Network Coding and Designs Over GF (q) COST
More informationCoding for Errors and Erasures in Random Network Coding
Coding for Errors and Erasures in Random Network Coding Ralf Koetter Institute for Communications Engineering TU Munich D-80333 Munich ralf.koetter@tum.de Frank R. Kschischang The Edward S. Rogers Sr.
More informationMATH 291T CODING THEORY
California State University, Fresno MATH 291T CODING THEORY Spring 2009 Instructor : Stefaan Delcroix Chapter 1 Introduction to Error-Correcting Codes It happens quite often that a message becomes corrupt
More informationDesign of linear Boolean network codes for combination networks
Louisiana State University LSU Digital Commons LSU Master's Theses Graduate School 2006 Design of linear Boolean network codes for combination networks Shoupei Li Louisiana State University and Agricultural
More informationRate region for a class of delay mitigating codes and P2P networks
Rate region for a class of delay mitigating codes and P2P networks Steven Weber, Congduan Li, John MacLaren Walsh Drexel University, Dept of ECE, Philadelphia, PA 19104 Abstract This paper identifies the
More informationExplicit MBR All-Symbol Locality Codes
Explicit MBR All-Symbol Locality Codes Govinda M. Kamath, Natalia Silberstein, N. Prakash, Ankit S. Rawat, V. Lalitha, O. Ozan Koyluoglu, P. Vijay Kumar, and Sriram Vishwanath 1 Abstract arxiv:1302.0744v2
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 informationBackground. Data hiding Data verification
Collaborators MIT: Dina Katabi, Minji Kim, Sachin Katti, Jianlong Tang, Fang Zhao Technical University of Munich: Ralf Koetter Caltech: Michelle Effros, Tracey Ho Chinese University of Hong Kong: Sid Jaggi
More informationSecret Sharing and Network Coding
Clemson University TigerPrints All Theses Theses 5-2013 Secret Sharing and Network Coding Fiona Knoll Clemson University, fknol309@gmail.com Follow this and additional works at: https://tigerprints.clemson.edu/all_theses
More informationCommunication Efficient Secret Sharing
1 Communication Efficient Secret Sharing Wentao Huang, Michael Langberg, Senior Member, IEEE, Joerg Kliewer, Senior Member, IEEE, and Jehoshua Bruck, Fellow, IEEE Abstract A secret sharing scheme is a
More informationCorrecting Bursty and Localized Deletions Using Guess & Check Codes
Correcting Bursty and Localized Deletions Using Guess & Chec Codes Serge Kas Hanna, Salim El Rouayheb ECE Department, Rutgers University serge..hanna@rutgers.edu, salim.elrouayheb@rutgers.edu Abstract
More informationThe Capacity Region for Multi-source Multi-sink Network Coding
The Capacity Region for Multi-source Multi-sink Network Coding Xijin Yan Dept. of Electrical Eng. - Systems University of Southern California Los Angeles, CA, U.S.A. xyan@usc.edu Raymond W. Yeung Dept.
More informationNetwork Coding for Error Correction
Network Coding for Error Correction Thesis by Svitlana S. Vyetrenko svitlana@caltech.edu In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology
More informationOn the minimum distance of LDPC codes based on repetition codes and permutation matrices 1
Fifteenth International Workshop on Algebraic and Combinatorial Coding Theory June 18-24, 216, Albena, Bulgaria pp. 168 173 On the minimum distance of LDPC codes based on repetition codes and permutation
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 informationNotes 10: List Decoding Reed-Solomon Codes and Concatenated codes
Introduction to Coding Theory CMU: Spring 010 Notes 10: List Decoding Reed-Solomon Codes and Concatenated codes April 010 Lecturer: Venkatesan Guruswami Scribe: Venkat Guruswami & Ali Kemal Sinop DRAFT
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 informationVulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links
Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Tie-Varying Jaing Links Jun Kurihara KDDI R&D Laboratories, Inc 2 5 Ohara, Fujiino, Saitaa, 356 8502 Japan Eail: kurihara@kddilabsjp
More informationHybrid Noncoherent Network Coding
Hybrid Noncoherent Network Coding Vitaly Skachek, Olgica Milenkovic, Angelia Nedić University of Illinois, Urbana-Champaign 1308 W. Main Street, Urbana, IL 61801, USA Abstract We describe a novel extension
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 informationIEEE TRANSACTIONS ON INFORMATION THEORY 1
IEEE TRANSACTIONS ON INFORMATION THEORY 1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 Proxy-Assisted Regenerating Codes With Uncoded Repair for Distributed Storage Systems Yuchong Hu,
More informationDistributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient
Distributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient Viveck R Cadambe, Syed A Jafar, Hamed Maleki Electrical Engineering and
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 information