A Relation Between Weight Enumerating Function and Number of Full Rank Sub-matrices
|
|
- Georgiana Berry
- 5 years ago
- Views:
Transcription
1 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, Bengaluru 56001, KA, India {vaddi, bsrajan}@iiscacin arxiv: v1 [csit] 17 Jan 019 Abstract In most of the networ coding problems with messages, the existence of binary networ coding solution over F depends on the existence of adequate sets of -dimensional binary vectors such that each set comprises of linearly independent ( vectors In a given n (n binary matrix, there exist n binary sub-matrices of size Every possible submatrix may be of full ran or singular depending on the columns present in the matrix In this wor, for full ran binary matrix G of size n satisfying certain condition on minimum Hamming weight, we establish a relation between the number of full ran sub-matrices of size and the weight enumerating function of the error correcting code with G as the generator matrix We give an algorithm to compute the number of full ran submatrices I INTRODUCTION Networ coding is a technique to enhance the rate of information transmission in a networ by taing advantage of redundancy in demands of various receivers Networ coding was introduced in [1] An acyclic networ can be represented as an acyclic directed graph D = (V,E, where V is the set of all nodes and E is the set of all edges in the networ Every edge E in D can carry one message symbol from the given finite field F q There exists a unique node S in D, called the source node, the source node has message symbols x i F q for i [1 : ] There exist some receiver nodes in the networ and each receiver wants some subset of message symbols {x 1,x,,x } The objective in networ coding is to satisfy the demands of all receivers by minimizing the number of transmissions in the edges of the networ A solution to the networ coding problem is the design of -dimensional precoding vectors (these precoding vectors are called global encoding ernels in networ coding to each edge in the networ such that these precoding vectors satisfy some linear independence constraints An -dimensional linear networ code on an acyclic networ over a field F q consists of a global encoding mapping f ni,n j : F q F q for each edge (n i,n j E in the networ The existence of linear networ coding solutions was studied in [] and [3] A construction of linear networ coding for multicast networ coding problems was studied in [4] Depending on the networ topology and requirement of the receivers, a networ may or may not have a solution in F In most of the networ coding problems, the existence of binary networ coding solution over F depends on the existence of adequate sets of -dimensional binary vectors such that each set comprises of linearly independent vectors The problem of index coding with side-information was introduced by Bir and Kol [5] In index coding problems, we often require the condition that a specific number of submatrices in a given n matrix needs to have full ran In index coding, the default choice for this n matrix is an n Vandermonde matrix The Vandermonde matrix exists over higher fields and the field size required depends on n Hence, it is useful to design binary n matrices satisfying the given linear independence conditions A Motivating Example Consider the networ coding problem as shown in Fig 1 In this networ coding problem, the source comprises of two messages and there exist six receivers, each of the receiver wants both the messages For this networ, linear solution over F is not possible [6] This is nown as the ( 4 combinational networ However, for the networ coding problem shown in Fig 1, if we remove any one receiver out of six receivers, then linear solution over F is possible as shown in Table I This follows from the fact that for any binary matrix of size 4, there exist atmost 5 full ran submatrices of size and this also ( means that binary coding solution does not exist for the 4 combinational networ Hence, the number of full ran submatrices in a binary matrix of size n is useful in analysing some multicast networ coding problems u 1 u 3 u x 1 x S R 1 R R 3 R 4 R 6 {x 1,x } {x 1,x } {x 1,x } {x 1,x } {x 1,x } {x 1,x } Fig 1: An instance of networ coding problem with no linear binary solution A linear (n, error correcting code over the field F q is a -dimensional subspace of F n q Let C denote the (n, linear u 4 R 5
2 Receivers Present R 1,R,R 3,R 4,R 5 R 1,R,R 3,R 4,R 6 R 1,R,R 3,R 5,R 6 R 1,R,R 4,R 5,R 6 R 1,R 3,R 4,R 5,R 6 R,R 3,R 4,R 5,R 1 Global encoding ernels for Out(S f s,u1 = [1 0] T,f s,u = [0 1] T f s,u3 = [1 1] T,f s,u4 = [1 1] T f s,u1 = [1 0] T,f s,u = [1 1] T f s,u3 = [0 1] T,f s,u4 = [1 1] T f s,u1 = [1 0] T,f s,u = [1 1] T f s,u3 = [1 1] T,f s,u4 = [0 1] T f s,u1 = [1 1] T,f s,u = [1 0] T f s,u3 = [0 1] T,f s,u4 = [1 1] T f s,u1 = [1 1] T,f s,u = [1 0] T f s,u3 = [1 1] T,f s,u4 = [0 1] T f s,u1 = [1 1] T,f s,u = [1 1] T f s,u3 = [1 0] T,f s,u4 = [0 1] T TABLE I: Global encoding ernels at Out(S for the six different networ coding problems obtained after removing one receiver R i for i [1 : 6] in Fig 1 Global encoding ernels for the edges in Out(u i is equal tof s,ui fori [1 : 4] error correcting code Let G and H be the generator and parity chec matrix of C The weight enumerating function of C is given by the polynomial n W C (x,y = A d x n d y d, d=0 where A d is the number of codewords with Hamming weight d and x,y are indeterminates We refer A d s for d [0 : n] as weight enumerator coefficients (WECs The linear bloc code generated by H as generator matrix is called dual of C and is denoted byc T The relation between weight enumerator W C (x,y of C and weight enumerator W C T(x,y of C T was derived by MacWilliams in [7] W C (x,y and W C T(x,y are related as W C T(x,y = 1 C W C(x+y,x y (1 For more details on error correcting codes and details on weight enumerators, the readers are referred to [8] Given a subspace V of F n, the space of all vectors orthogonal to V in F n is called orthogonal complement of V For any given arbitrary full ran matrix G of size n, from the fundamental theorem of linear algebra, the null space is the orthogonal complement of the row space The dimension of the row space of G is, the dimension of null space of G is and the sum of the dimension of the null space and row space is equal to n For any given arbitrary full ran matrix A of size n, we refer B of size ( n as orthogonal complement of A if the ran of B is and AB T is all zero matrix Let G be a full ran n binary matrix Let H be an orthogonal complement of G If n, let d be the minimum Hamming weight of the error correcting code generated byh Else, letd be the minimum Hamming weight of the error correcting code generated by G B Contributions The contributions of this paper are summarized below: For a given binary full ran n matrix G, we show that the number of full ran submatrices in G are equal to the number of full ran ( ( submatrices in the orthogonal complement of G In any binary full ran matrix G of size n, if 3d > max(,, we establish a relation between the weight enumerating function W C (x,y of C generated by G and the number of full ran submatrices of size ing We explicitly quantify the number of full ran submatrices of size in G For a binary full ran matrix G of size n satisfying the condition 3d > max(,, we give an algorithm to compute the number of full ran submatrices of size in G II ON WEIGHT ENUMERATOR FUNCTION AND THE NUMBER OF FULL-RANK MATRICES Lemma 1 and Lemma given below are useful to derive the main result in this section Lemma 1 Let G be a binary n matrix Let G (s be the n symmetric matrix obtained from G by using elementary row operations The matrix G (s is of the form [I : P ( ] If the columns corresponding to the indices {i 1,i,,i } [1 : n] are linearly dependent in G, then the columns corresponding to the indices {i 1,i,,i } are linearly dependent in G (s also Proof Let r i and r i be the ith row of G andg (s respectively for every i [1 : ] Let c j and c j be the jth column of G and G (s respectively for every j [1 : n] Let g i,j and g i,j be the element in the ith row and jth column of G and G (s respectively for every i [1 : ] and j [1 : n] In the matrix G (s, let the ith row be a linear combination of rows in the matrix G We can write r i = f i (r 1,r,,r for i [1 : ], ( where f i is some linear function over F From (, we can write g i,j as g i,j = f i (g 1,j,g,j,,g,j for i [1 : ] and j [1 : n] (3 Given that the columns corresponding to the indices {i 1,i,,i } [1 : n] are linearly dependent in G There exists a 1,a,,a F such that From (4, we have a 1 c i 1 +a c i ++a c i = 0 (4 a 1 g 1,i 1 +a g 1,i ++a g 1,i = 0 a 1 g,i 1 +a g,i ++a g,i = 0 a 1 g,i 1 +a g,i ++a g,i = 0 (5
3 From (5, for every i [1 : ], we have From (6, we have a 1 f i (g 1,i 1,g,i 1,,g,i 1 + a f i (g 1,i,g,i,,g,i ++ a f i (g 1,i,g,i,,g,i = 0 (6 a 1 g i,i1 +a g i,i ++a g i,i = 0 for every i [1 : ] (7 From (7, we have a 1 c i1 +a c i ++a c i = 0 That is, the columns c i1,c i,,c i of G (s are linearly dependent Lemma Let G be a binary n matrix of the form [I : P ( ] Define the ( n matrix H as given below H = [P T ( : I ( (] If {i 1,i,,i } [1 : n] be indices of any linearly dependent columns in G, then the ( columns corresponding to the indices[1 : n]/{i 1,i,,i } inhare linearly dependent Proof We have GH T = [I : P ( ][P T ( : I ( (] T = P ( +P ( = 0 ( The ran of the matrices G and H are and n respectively and every row in G is orthogonal (inner product is zero to every other row in H over F Hence, the row space spanned by G and H are orthogonal complements Let {i 1,i,,i } [1 : n] be indices of any linearly dependent columns in G Consider a binary vector v F n such that v has 1s in i 1,i,,i positions and 0 in other positions The vectorv must be in the null space ofgand row space of H Consider a binary vectorṽ F n such that it has 0 in i 1,i,,i positions and 1 in other positions The vector ṽ must be in the row space of G (row space of G and H are orthogonal complements Hence, we have Hṽ = 0 and the columns corresponding to the indices [1 : n]/{i 1,i,,i } in H are linearly dependent Corollary 1 Let G be a binary n matrix of the form [I : P ( ] Define the ( n matrix H as given below H = [P T ( : I ( (] If {i 1,i,,i } [1 : n] be indices of any linearly independent columns in G, then the (n columns corresponding to the indices [1 : n]/{i 1,i,,i } in H are linearly independent Remar 1 The number of linearly independent submatrices of size in G is equal to the number of linearly independent submatrices of size ( ( in H Example 1 Consider the matrices G and H given below G = ,H = [ ] The columns with indices {1,, 3, 5} are linearly dependent in G Hence, the columns [1 : 7]\{1,,3,5} = {4,6,7} are linearly dependent in H The columns with indices {1,4,6,7} are linearly independent in G Hence, the columns [1 : 7]\{1,4,6,7}= {,3,5} are linearly independent in H Definition 1 Let G = [I : P ( ] be a binary full ran matrix of size n We can select any set of t columns for 1 t from the columns of P ( in 1 ways Let {c i1,c i,,c it } be the t selected columns in P ( The effective distance d (e (i 1,i,,i t of these t columns is defined as d (e (i 1,i,,i t = d H (c i1 +c i ++c it +t, where d H (c i1 + c i + + c it is the Hamming weight of ( dimensional binary vector c i1 +c i ++c it Example Consider the matrix G given below [ ] G = The effective distances of the matrix G are as follows: d (e (4 = d H (111+1 = 4, d (e (5 = d H (110+1 = 3, d (e (6 = d H (101+1 = 3, d (e (4,5 = d H ( = 3, d (e (4,6 = d H ( = 3, d (e (5,6 = d H ( = 4, d (e (4,5,6 = d H ( = 4 Theorem 1 establishes the relation between weight enumerating function and the number of singular matrices of a full ran binary matrix of size n Theorem 1 Consider an arbitrary binary full ran matrix G of size n (n Let C be the linear bloc code generated by G as generator matrix and C T be the dual code of C Let D be the number of singular submatrices of size in G If 3d > max(,, then D =, (8 where d=d A d A d s are the weight enumerating coefficients of W C T(x,y if A d s are the weight enumerating coefficients of W C (x,y if <
4 Proof Let G (s = [I P ( ] be the systematic generator matrix for C From Lemma 1, the number of linearly dependent -column sets in G is equal to the number of linearly dependent -column sets in G (s Let H = [P T I ( (] be the parity chec matrix for C Let c j be the jth column of G (s for j [1 : n] Case (i :- For every {i 1,i,,i t } [ + 1 : n], let j 1,j,, j dh(c i1 +c i ++c it be the positions of 1s present in c i1 + c i + +c it Note that c j1,c j,,c jdh (c i1 +c i ++c it are the columns of identity matrix present in G (s with 1s in j 1,j,, j dh(c i1 +c i ++c it positions respectively Hence, in the matrix G, the d (e (i 1,i,,i t number of columns {c i1,c i,,c it } {c j1,c j,,c }{{} } jdh (c i1 +c i +,c it }{{} t columns d H(c i1 +c i ++c it are linearly dependent If d (e (i 1,i,,i t, then, any combination of d (e (i 1,i,,i t columns in the remaining n d (e (i 1,i,,i t along with the d (e (i 1,i,,i t columns {c i1,c i,,c it } {c j1,c j,,c jdh (c i1 +c i +,c it }of G are linearly dependent Hence, there exists ( n d (e (i 1,i,,i d (e (i 1,i,,i t sets of size, which are linearly dependent and which comprise {c i1,c i,,c it } The total number of linearly dependent sets of -columns are ( n d (e (i 1,i,,i t D = d (e (i 1,i,,i t {i 1,i,,i t} [+1:n] ( n d (e (i 1,i,,i t = (9 We have {i 1,i,,i t} [+1:n] d (e (i 1,i,,i t = d H (c i1 +c i ++c it +t = d H (c i1 +c i ++c it +d H (sum of any t columns of I = Hamming weight of codeword generated by i 1,i,,i t }{{} [1:] By using (10, we can write (9 as ( n d (e (i 1,i,,i t D = = {i 1,i,,i t} [+1:n] n d=d A d = d=d A d rows of H (10, (11 where A d s are the weight enumerating coefficients of C T The last equality in (11 follows from the fact that the codewords with weight from +1 to n in H do not yield any set of columns which are linearly dependent Now, if 3d > max(, =, we would show that there is no double counting in (9 From (10, the minimum value i 1 i i 3 i 4 i d1 Fig d Fig 3 of d (e (i 1,i,,i t for any {i 1,i,,i t } [ + 1 : n] is d Consider a codeword of H with Hamming weight d 1 d and having 1s in i 1,i,,i d1 positions Hence, the i 1,i,,i d1 th columns with any combination of ( d 1 columns in the remaining (n d 1 columns of G are linearly dependent There exists ( n d 1 d 1 sets of size, which are linearly dependent and which comprisei 1,i,,i d1 columns Let these ( n d 1 d 1 sets of size columns be S1 Consider any other codeword of H with Hamming weight d d and having 1s in If 1,,, d positions Hence, the 1,,, d th columns with any combination of ( d columns in the remaining (n d columns of G are linearly dependent There exists ( n d d sets of size, which are linearly dependent and which comprisei 1,i,,i d columns Let these ( n d d sets of size columns be S We need to show all the column sets in S 1 are distinct to the columns sets in S Let there exists a column set which is common in both S 1 and S With out loss of generality, we assume that this common set is as shown in Figure and Figure 3 Because the indices in Figure and Figure 3 are equal, the d 1 vacant positions in Figure should have indices from the set { 1,,, d } which are not present in the set {i 1,i,,i d1 } Similarly, The d vacant positions in Figure 3 should have indices from the set {i 1,i,,i d1 } which are not present in the set { 1,,, d } But, we have {i 1,i,,i d1 } and { 1,,, d } differ in atleast d indices (d is the minimum Hamming distance of H Hence, we have This implies ( d 1 +( d d d +d 1 +d 3d This is a contradiction because we assumed 3d > Hence, there exists no column set which are common in both S 1 and S Case (ii < :- In Lemma, we proved that the number of linearly dependent n column sets in H are same as that of number of linearly dependent column sets in G (s Let H (s = [I ( ( P T ] That is, H(s is obtained by rearranging the columns of H The number of linearly dependent column sets in H and H (s are same The matrix
5 H (s satisfies the condition given in case (i Hence, for H (s, we can write (11 as D = A d, (1 wherea d s are the weight enumerating coefficients of(c T T = C The number of column sets that are linearly dependent is equal to the number of singular matrices in G This completes the proof Theorem Consider an arbitrary binary full ran matrix G of size n (n Let C be the linear bloc code generated by G as generator matrix and C T be the dual code of C Let I be the number of full ran submatrices of size in G If 3d > max(,, then where I = ( n A d, A d s are the WECs of W C T(x,y if A d s are the WECs of W C (x,y if < Proof In a binary matrix of size n, there exist ( n binary sub-matrices of size Each of this sub-matrix may be of full ran or singular Thus, we have ( n D +I = where D is the number of singular sub-matrices in G The remaining proof follows from Theorem 1 Remar To calculate D and I, we use the weight enumerating coefficients of either C or C T that satisfy the condition length of the code dimension < Remar 3 For a given binary full ran matrix of size n, to calculate I by using brute-force technique requires the ran computation of ( n number of matrices Whereas, by using Theorem, one only needs to now the weight enumerating coefficients of the given n matrix or its orthogonal complement The weight enumerating coefficients required in Theorem of any arbitrary n matrix needs the computation of Hamming weight of min(, binary vectors of size n For a binary full ran matrix G of size n satisfying the condition 3d > max(,, Algorithm 1 finds the number of full ran submatrices of size in G Example 3 Consider matrix G given below G = Algorithm 1 Algorithm to find the number of full ran submatrices of size in a given full ran matrix G of size n Step 1 11: Convert the matrix G in symmetric form by using elementary row operations Let this symmetric matrix be G (s = [I : P ( ] (Lemma 1 1: If < n, Go to Step 13: Else G (s = [P T ( : I ( (] (Lemma Step 1: Find the weight enumerating coefficients of G (s Let A d for d [1 : n] be the weight enumerating coefficients of G (s : I = ( n A d Step 3 Exit ( n d (Theorem For the matrix G, we have = 4,n = 7 By using the elementary row operations, the matrix G can be converted into symmetric matrix G (s the matrix G (s is given below G (s = [I 4 4 : P 4 3 ] = For the matrix G (s, we have Hence, we need to calculate D and I from weight enumerating coefficients of C T The generator matrix of C T is given below [ ] [P T 3 4 : I 3 3 ] = The weight enumerating function of C T can be calculated by enumerating all the 3 = 8 codewords generated by above 3 7 matrix The weight enumerating function is given by W C T(x,y = x 7 +7x 4 y 4 (13 From (13, we have d = 4,A 4 = 7 and A d = 0 for d 4 The and d in this example satisfy the condition 3d > max(, From Theorem 1, we have ( ( ( n d n 4 4 D = A d = A 4 = 7 = 7 4 From Theorem, we have I = ( n D = 35 7 = 8 The 4-column sets corresponding to the 7 singular 4 4 matrices are given below D 1 = {1,,3,5}, D = {1,,4,6}, D 3 = {1,3,4,7} D 4 = {3,4,5,6}, D 5 = {,3,6,7}, D 6 = {,4,5,7} D 7 = {1,5,6,7} The 4-column sets corresponding to the 8 full-ran 4 4 matrices are given below
6 I 1 = {1,,3,4}, I = {1,,3,5}, I 3 = {1,,3,7} I 4 = {1,,4,6}, I 5 = {1,,4,7}, I 6 = {1,,5,6} I 7 = {1,,5,7}, I 8 = {1,,6,7}, I 9 = {1,3,4,5}, I 10 = {1,3,4,6}, I 11 = {1,3,5,6}, I 1 = {1,3,5,7}, I 13 = {1,3,6,7}, I 14 = {1,4,5,6}, I 15 = {1,4,5,7}, I 16 = {1,4,6,7}, I 17 = {,3,4,5}, I 18 = {,3,4,6}, I 19 = {,3,4,7}, I 0 = {,3,5,6}, I 1 = {,3,6,7}, I = {,4,5,6}, I 3 = {,4,5,7}, I 4 = {,5,6,7}, I 5 = {3,4,5,7}, I 6 = {3,4,6,7}, I 7 = {3,5,6,7} I 8 = {4,5,6,7} Note 1 The matrix G given in Example 3 is a generator matrix of(7, 4 Hamming code Hence, in the generator matrix of (7,4 Hamming code, there exist 8 full ran submatrices of size 4 4 From Lemma, in the parity chec matrix of (7,4 Hamming code, there exist 8 full ran submatrices of size 3 3 Example 4 Consider matrix G given below G = For the matrix G, we have = 7,n = 10 and the matrix G (s is given below G (s = [I 7 7 : P 7 3 ] = For the matrix G (s, we have Hence, we need to calculate D and I from weight enumerating coefficients of C T The generator matrix of C T is given below [P T 3 7 : I 3 3] = [ ] The weight enumerating function of C T can be calculated by enumerating all the 3 = 8 codewords generated by above 3 10 matrix The weight enumerating function is given by W C T(x,y = x 10 +7x 4 y 6 (14 From (14, we have d = 6,A 6 = 7 and A d = 0 for d 6 The and d in this example satisfy the condition 3d > max(, From Theorem 1, we have D = A d = A 6 ( n 6 ( 4 = 6 = 8 3 From Theorem, we have ( n I = D = 10 8 = 9 Example 5 Consider a generator matrix G of (n = 15, = 11 Hamming code The weight enumerating function of the dual of the (15,11 Hamming code is W C T(x,y = x x 7 y 8 In this example, we have n and hence d is the minimum Hamming weight of the error correcting code generated by H and d = 8 The and d in this example satisfy the condition 3d > max(, From Theorem 1, we have D = A d = A 8 ( n 8 ( 7 = 15 = 55 4 From Theorem, we have ( 15 I = D = 1, = Note In a generator matrix of (15, 11 Hamming code, there exist 840 full ran submatrices of size From Lemma, in the parity chec matrix of (15,11 Hamming code, there exist 840 full ran submatrices of size 4 4 III SCOPE FOR FUTURE WORK In this paper, for a n binary full ran matrix satisfying a condition of minimum Hamming weight, we quantified the number of binary full ran submatrices of size in terms of weight enumerating function Some of the interesting problems are given below Establishing the relation between the number of full ran submatrices of size for any arbitrary full ran binary matrix of size n is an interesting problem For given positive integers and n (n >, finding the maximum value of I and the corresponding matrix G is an interesting problem Extending the result given in this paper to other fields is an interesting problem ACKNOWLEDGEMENT This wor was supported partly by the Science and Engineering Research Board (SERB of Department of Science and Technology (DST, Government of India, through JC Bose National Fellowship to B Sundar Rajan
7 REFERENCES [1] R Ahlswede, N Cai, R Li, and R Yeung, Networ information flow, in proc IEEE Trans Inf Theory, vol 46, no 4, pp , Jul 000 [] N Cai, S-Y R Li, and R W Yeung, Linear networ coding, in proc IEEE Trans Inf Theory, vol 49, no, pp , Feb 003 [3] R Koetter and M Medard, An algebraic approach to networ coding, in proc IEEE/ACM Trans Netw, vol 11, no 5, pp , Oct 003 [4] S Jaggi et al, Polynomial time algorithms for multicast networ code construction, in proc IEEE Trans Inf Theory, vol 51, no 6, pp , Jun 005 [5] Y Bir and T Kol, Informed-source coding-on-demand (ISCOD over broadcast channels, in Proc IEEE Conf Comput Commun, San Francisco, CA, 1998, pp [6] R Yeung, S Y Li and N Cai, Networ Coding Theory, Now Publishers Inc 006 [7] F J MacWilliams, A theorem on the distribution of weights in a systematic codes, Bell Syst Tech J 4: 79-94, 1963 [8] F J MacWilliams and N J Sloane, The theory of error correcting codes, Elsevier, 1977
Optimal 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 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 informationVector spaces. EE 387, Notes 8, Handout #12
Vector spaces EE 387, Notes 8, Handout #12 A vector space V of vectors over a field F of scalars is a set with a binary operator + on V and a scalar-vector product satisfying these axioms: 1. (V, +) is
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 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 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 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 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 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 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 informationThe Hamming Codes and Delsarte s Linear Programming Bound
The Hamming Codes and Delsarte s Linear Programming Bound by Sky McKinley Under the Astute Tutelage of Professor John S. Caughman, IV A thesis submitted in partial fulfillment of the requirements for the
More informationChapter 3 Linear Block Codes
Wireless Information Transmission System Lab. Chapter 3 Linear Block Codes Institute of Communications Engineering National Sun Yat-sen University Outlines Introduction to linear block codes Syndrome and
More informationLecture B04 : Linear codes and singleton bound
IITM-CS6845: Theory Toolkit February 1, 2012 Lecture B04 : Linear codes and singleton bound Lecturer: Jayalal Sarma Scribe: T Devanathan We start by proving a generalization of Hamming Bound, which we
More informationPermutation decoding for the binary codes from triangular graphs
Permutation decoding for the binary codes from triangular graphs J. D. Key J. Moori B. G. Rodrigues August 6, 2003 Abstract By finding explicit PD-sets we show that permutation decoding can be used for
More informationLecture Introduction. 2 Linear codes. CS CTT Current Topics in Theoretical CS Oct 4, 2012
CS 59000 CTT Current Topics in Theoretical CS Oct 4, 01 Lecturer: Elena Grigorescu Lecture 14 Scribe: Selvakumaran Vadivelmurugan 1 Introduction We introduced error-correcting codes and linear codes in
More informationBinary Linear Codes G = = [ I 3 B ] , G 4 = None of these matrices are in standard form. Note that the matrix 1 0 0
Coding Theory Massoud Malek Binary Linear Codes Generator and Parity-Check Matrices. A subset C of IK n is called a linear code, if C is a subspace of IK n (i.e., C is closed under addition). A linear
More informationMatrix characterization of linear codes with arbitrary Hamming weight hierarchy
Linear Algebra and its Applications 412 (2006) 396 407 www.elsevier.com/locate/laa Matrix characterization of linear codes with arbitrary Hamming weight hierarchy G. Viswanath, B. Sundar Rajan Department
More informationSolutions of Exam Coding Theory (2MMC30), 23 June (1.a) Consider the 4 4 matrices as words in F 16
Solutions of Exam Coding Theory (2MMC30), 23 June 2016 (1.a) Consider the 4 4 matrices as words in F 16 2, the binary vector space of dimension 16. C is the code of all binary 4 4 matrices such that the
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 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 informationThe extended coset leader weight enumerator
The extended coset leader weight enumerator Relinde Jurrius Ruud Pellikaan Eindhoven University of Technology, The Netherlands Symposium on Information Theory in the Benelux, 2009 1/14 Outline Codes, weights
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 informationCodes for Partially Stuck-at Memory Cells
1 Codes for Partially Stuck-at Memory Cells Antonia Wachter-Zeh and Eitan Yaakobi Department of Computer Science Technion Israel Institute of Technology, Haifa, Israel Email: {antonia, yaakobi@cs.technion.ac.il
More informationElementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q),
Elementary 2-Group Character Codes Cunsheng Ding 1, David Kohel 2, and San Ling Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an odd prime. These codes
More informationAlgorithms to Compute Bases and the Rank of a Matrix
Algorithms to Compute Bases and the Rank of a Matrix Subspaces associated to a matrix Suppose that A is an m n matrix The row space of A is the subspace of R n spanned by the rows of A The column space
More informationCyclic Redundancy Check Codes
Cyclic Redundancy Check Codes Lectures No. 17 and 18 Dr. Aoife Moloney School of Electronics and Communications Dublin Institute of Technology Overview These lectures will look at the following: Cyclic
More informationICT12 8. Linear codes. The Gilbert-Varshamov lower bound and the MacWilliams identities SXD
1 ICT12 8. Linear codes. The Gilbert-Varshamov lower bound and the MacWilliams identities 19.10.2012 SXD 8.1. The Gilbert Varshamov existence condition 8.2. The MacWilliams identities 2 8.1. The Gilbert
More informationOn Random Network Coding for Multicast
On Random Network Coding for Multicast Adrian Tauste Campo Universitat Pompeu Fabra Barcelona, Spain Alex Grant Institute for Telecommunications Research University of South Australia arxiv:cs/7252v [cs.it]
More informationAssignment 1 Math 5341 Linear Algebra Review. Give complete answers to each of the following questions. Show all of your work.
Assignment 1 Math 5341 Linear Algebra Review Give complete answers to each of the following questions Show all of your work Note: You might struggle with some of these questions, either because it has
More informationCirculant Hadamard matrices as HFP-codes of type C 4n C 2. arxiv: v1 [math.co] 26 Nov 2017
Circulant Hadamard matrices as HFP-codes of type C 4n C 2. arxiv:1711.09373v1 [math.co] 26 Nov 2017 J. Rifà Department of Information and Communications Engineering, Universitat Autònoma de Barcelona October
More informationLecture 14: Hamming and Hadamard Codes
CSCI-B69: A Theorist s Toolkit, Fall 6 Oct 6 Lecture 4: Hamming and Hadamard Codes Lecturer: Yuan Zhou Scribe: Kaiyuan Zhu Recap Recall from the last lecture that error-correcting codes are in fact injective
More informationOptimal Index Codes with Near-Extreme Rates
0 IEEE International Symposium on Information Theory Proceedings Optimal Index Codes with Near-Extreme Rates Son Hoang Dau Division of Mathematical Sciences School of Phys. and Math. Sciences Nanyang Technological
More 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 informationDistributed Reed-Solomon Codes
Distributed Reed-Solomon Codes Farzad Parvaresh f.parvaresh@eng.ui.ac.ir University of Isfahan Institute for Network Coding CUHK, Hong Kong August 216 Research interests List-decoding of algebraic codes
More 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 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 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 informationOn MBR codes with replication
On MBR codes with replication M. Nikhil Krishnan and P. Vijay Kumar, Fellow, IEEE Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore. Email: nikhilkrishnan.m@gmail.com,
More informationNetwork Coding for Computing
Networ Coding for Computing Rathinaumar Appuswamy, Massimo Franceschetti, Nihil Karamchandani, and Kenneth Zeger Abstract The following networ computation problem is considered A set of source nodes in
More informationTHE ANALYTICAL DESCRIPTION OF REGULAR LDPC CODES CORRECTING ABILITY
Transport and Telecommunication Vol. 5, no. 3, 04 Transport and Telecommunication, 04, volume 5, no. 3, 77 84 Transport and Telecommunication Institute, Lomonosova, Riga, LV-09, Latvia DOI 0.478/ttj-04-005
More informationEE 229B ERROR CONTROL CODING Spring 2005
EE 229B ERROR CONTROL CODING Spring 2005 Solutions for Homework 1 1. Is there room? Prove or disprove : There is a (12,7) binary linear code with d min = 5. If there were a (12,7) binary linear code with
More informationDesign of Non-Binary Quasi-Cyclic LDPC Codes by Absorbing Set Removal
Design of Non-Binary Quasi-Cyclic LDPC Codes by Absorbing Set Removal Behzad Amiri Electrical Eng. Department University of California, Los Angeles Los Angeles, USA Email: amiri@ucla.edu Jorge Arturo Flores
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 informationLET F q be the finite field of size q. For two k l matrices
1 Codes and Designs Related to Lifted MRD Codes Tuvi Etzion, Fellow, IEEE and Natalia Silberstein arxiv:1102.2593v5 [cs.it 17 ug 2012 bstract Lifted maximum ran distance (MRD) codes, which are constant
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 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 informationFountain Uncorrectable Sets and Finite-Length Analysis
Fountain Uncorrectable Sets and Finite-Length Analysis Wen Ji 1, Bo-Wei Chen 2, and Yiqiang Chen 1 1 Beijing Key Laboratory of Mobile Computing and Pervasive Device Institute of Computing Technology, Chinese
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 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 informationAlgebraic gossip on Arbitrary Networks
Algebraic gossip on Arbitrary etworks Dinkar Vasudevan and Shrinivas Kudekar School of Computer and Communication Sciences, EPFL, Lausanne. Email: {dinkar.vasudevan,shrinivas.kudekar}@epfl.ch arxiv:090.444v
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 informationAn Extended Fano s Inequality for the Finite Blocklength Coding
An Extended Fano s Inequality for the Finite Bloclength Coding Yunquan Dong, Pingyi Fan {dongyq8@mails,fpy@mail}.tsinghua.edu.cn Department of Electronic Engineering, Tsinghua University, Beijing, P.R.
More informationComputing Linear Functions by Linear Coding Over Networks
422 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 60, NO 1, JANUARY 2014 Computing Linear Functions by Linear Coding Over Networks Rathinakumar Appuswamy, Member, IEEE, and Massimo Franceschetti Abstract
More informationStructured Low-Density Parity-Check Codes: Algebraic Constructions
Structured Low-Density Parity-Check Codes: Algebraic Constructions Shu Lin Department of Electrical and Computer Engineering University of California, Davis Davis, California 95616 Email:shulin@ece.ucdavis.edu
More informationA Singleton Bound for Lattice Schemes
1 A Singleton Bound for Lattice Schemes Srikanth B. Pai, B. Sundar Rajan, Fellow, IEEE Abstract arxiv:1301.6456v4 [cs.it] 16 Jun 2015 In this paper, we derive a Singleton bound for lattice schemes and
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 informationLecture 2 Linear Codes
Lecture 2 Linear Codes 2.1. Linear Codes From now on we want to identify the alphabet Σ with a finite field F q. For general codes, introduced in the last section, the description is hard. For a code of
More informationON PERTURBATION OF BINARY LINEAR CODES. PANKAJ K. DAS and LALIT K. VASHISHT
Math Appl 4 (2015), 91 99 DOI: 1013164/ma201507 ON PERTURBATION OF BINARY LINEAR CODES PANKAJ K DAS and LALIT K VASHISHT Abstract We present new codes by perturbation of rows of the generating matrix of
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 informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationMT5821 Advanced Combinatorics
MT5821 Advanced Combinatorics 1 Error-correcting codes In this section of the notes, we have a quick look at coding theory. After a motivating introduction, we discuss the weight enumerator of a code,
More informationAdaptive Cut Generation for Improved Linear Programming Decoding of Binary Linear Codes
Adaptive Cut Generation for Improved Linear Programming Decoding of Binary Linear Codes Xiaojie Zhang and Paul H. Siegel University of California, San Diego, La Jolla, CA 9093, U Email:{ericzhang, psiegel}@ucsd.edu
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 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 informationMATH3302. Coding and Cryptography. Coding Theory
MATH3302 Coding and Cryptography Coding Theory 2010 Contents 1 Introduction to coding theory 2 1.1 Introduction.......................................... 2 1.2 Basic definitions and assumptions..............................
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 informationA REVERSIBLE CODE OVER GE(q)
KYBERNETIKA- VOLUME 22 (1986), NUMBER 1 A REVERSIBLE CODE OVER GE(q) SUNIL KUMAR MUTTOO*, SHANKAR LAL This paper deals with the construction of codes over GF(q), q prime, by annexing two triangular matrices,
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 informationexercise in the previous class (1)
exercise in the previous class () Consider an odd parity check code C whose codewords are (x,, x k, p) with p = x + +x k +. Is C a linear code? No. x =, x 2 =x =...=x k = p =, and... is a codeword x 2
More informationQuantum LDPC Codes Derived from Combinatorial Objects and Latin Squares
Codes Derived from Combinatorial Objects and s Salah A. Aly & Latin salah at cs.tamu.edu PhD Candidate Department of Computer Science Texas A&M University November 11, 2007 Motivation for Computers computers
More informationSector-Disk Codes and Partial MDS Codes with up to Three Global Parities
Sector-Disk Codes and Partial MDS Codes with up to Three Global Parities Junyu Chen Department of Information Engineering The Chinese University of Hong Kong Email: cj0@alumniiecuhkeduhk Kenneth W Shum
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 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 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 informationOn the Berlekamp/Massey Algorithm and Counting Singular Hankel Matrices over a Finite Field
On the Berlekamp/Massey Algorithm and Counting Singular Hankel Matrices over a Finite Field Matthew T Comer Dept of Mathematics, North Carolina State University Raleigh, North Carolina, 27695-8205 USA
More informationLecture 4: Linear Codes. Copyright G. Caire 88
Lecture 4: Linear Codes Copyright G. Caire 88 Linear codes over F q We let X = F q for some prime power q. Most important case: q =2(binary codes). Without loss of generality, we may represent the information
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 informationOn the Feasibility of Precoding-Based Network Alignment for Three Unicast Sessions
On the Feasibility of Precoding-Based Network Alignment for Three Unicast Sessions Chun Meng, Abinesh Ramakrishnan, Athina Markopoulou, Syed Ali Jafar Department of Electrical Engineering and Computer
More 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 informationCoding for Memory with Stuck-at Defects
Coding for Memory with Stuck-at Defects Yongjune Kim B. V. K. Vijaya Kumar Electrical Computer Engineering, Data Storage Systems Center (DSSC) Carnegie Mellon University Pittsburgh, USA yongjunekim@cmu.edu,
More informationOn Weight Enumerators and MacWilliams Identity for Convolutional Codes
On Weight Enumerators and MacWilliams Identity for Convolutional Codes Irina E Bocharova 1, Florian Hug, Rolf Johannesson, and Boris D Kudryashov 1 1 Dept of Information Systems St Petersburg Univ of Information
More informationDeterministic Network Coding by Matrix Completion
Deterministic Network Coding by Matrix Completion Nicholas J. A. Harvey David R. Karger Kazuo Murota Abstract We present a new deterministic algorithm to construct network codes for multicast problems,
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 informationLinear Exact Repair Rate Region of (k + 1, k, k) Distributed Storage Systems: A New Approach
Linear Exact Repair Rate Region of (k + 1, k, k) Distributed Storage Systems: A New Approach Mehran Elyasi Department of ECE University of Minnesota melyasi@umn.edu Soheil Mohajer Department of ECE University
More informationError Detection and Correction: Hamming Code; Reed-Muller Code
Error Detection and Correction: Hamming Code; Reed-Muller Code Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Hamming Code: Motivation
More informationConstructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach
Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach Shu Lin, Shumei Song, Lan Lan, Lingqi Zeng and Ying Y Tai Department of Electrical & Computer Engineering University of California,
More informationTRANSPORTATION PROBLEMS
Chapter 6 TRANSPORTATION PROBLEMS 61 Transportation Model Transportation models deal with the determination of a minimum-cost plan for transporting a commodity from a number of sources to a number of destinations
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 information7.1 Definitions and Generator Polynomials
Chapter 7 Cyclic Codes Lecture 21, March 29, 2011 7.1 Definitions and Generator Polynomials Cyclic codes are an important class of linear codes for which the encoding and decoding can be efficiently implemented
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 informationSymmetric configurations for bipartite-graph codes
Eleventh International Workshop on Algebraic and Combinatorial Coding Theory June 16-22, 2008, Pamporovo, Bulgaria pp. 63-69 Symmetric configurations for bipartite-graph codes Alexander Davydov adav@iitp.ru
More informationVandermonde-form Preserving Matrices And The Generalized Signal Richness Preservation Problem
Vandermonde-form Preserving Matrices And The Generalized Signal Richness Preservation Problem Borching Su Department of Electrical Engineering California Institute of Technology Pasadena, California 91125
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
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 informationMathematics Department
Mathematics Department Matthew Pressland Room 7.355 V57 WT 27/8 Advanced Higher Mathematics for INFOTECH Exercise Sheet 2. Let C F 6 3 be the linear code defined by the generator matrix G = 2 2 (a) Find
More information: Coding Theory. Notes by Assoc. Prof. Dr. Patanee Udomkavanich October 30, upattane
2301532 : Coding Theory Notes by Assoc. Prof. Dr. Patanee Udomkavanich October 30, 2006 http://pioneer.chula.ac.th/ upattane Chapter 1 Error detection, correction and decoding 1.1 Basic definitions and
More informationFinite Mathematics. Nik Ruškuc and Colva M. Roney-Dougal
Finite Mathematics Nik Ruškuc and Colva M. Roney-Dougal September 19, 2011 Contents 1 Introduction 3 1 About the course............................. 3 2 A review of some algebraic structures.................
More informationWeek 3: January 22-26, 2018
EE564/CSE554: Error Correcting Codes Spring 2018 Lecturer: Viveck R. Cadambe Week 3: January 22-26, 2018 Scribe: Yu-Tse Lin Disclaimer: These notes have not been subjected to the usual scrutiny reserved
More informationProgress on High-rate MSR Codes: Enabling Arbitrary Number of Helper Nodes
Progress on High-rate MSR Codes: Enabling Arbitrary Number of Helper Nodes Ankit Singh Rawat CS Department Carnegie Mellon University Pittsburgh, PA 523 Email: asrawat@andrewcmuedu O Ozan Koyluoglu Department
More informationSome results on the existence of t-all-or-nothing transforms over arbitrary alphabets
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets Navid Nasr Esfahani, Ian Goldberg and Douglas R. Stinson David R. Cheriton School of Computer Science University of
More information