On Linear Subspace Codes Closed under Intersection
|
|
- Derek Ross
- 6 years ago
- Views:
Transcription
1 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 n q. Koetter and Kschischang argued that subspace codes are useful for error and erasure correction in random network coding. Linearity in subspace codes was defined by Braun, Etzion and Vardy, and they conjectured that the largest cardinality of a linear subspace code in P q(n) is 2 n. In this paper, we show that the conjecture holds for linear subspace codes that are closed under intersection, i.e., codes having the property that the intersection of any pair of codewords is also a codeword. The proof is via a characterization of such codes in terms of partitions of linearly independent subsets of F n q. I. INTRODUCTION Let F n q be the vector space of dimension n over the field F q of order q. The set of all subspaces of F n q is called the projective space of order n over F q and is denoted by P q (n). The subspace distance function in a projective space is defined as follows: for X, Y P q (n), d S (X, Y ) := dim X + dim Y 2 dim(x Y ). The subspace distance measure d S turns P q (n) into a metric space [1]. An (n, M, d) code in the projective space P q (n) is defined to be any C P q (n) such that C = M and d S (X, Y ) d for all X, Y C. Any such code C is also called a subspace code. Koetter and Kschischang showed [1] that subspace codes defined in projective space P q (n) are useful for error and erasure correction in random networks. To be precise, they showed that an (n, M, d) code is capable of correcting any combination of t packet errors as well as ρ packet erasures introduced anywhere within the network, as long as 2(t + ρ) < d. Thus, a natural analogy can be drawn between error and erasure correction in random network coding and that in classical coding over F n q. It makes sense to use this analogy to develop aspects of subspace codes along the same lines as those of classical error-correcting codes. Indeed, there has been much prior work in this spirit, for example, bounds of the Gilbert-Varshamov type [3] and the Singleton type [11] have been derived for subspace codes. Other aspects of these codes have been explored in the existing literature see e.g., [1], [4], [5], [6], [7], [8], [9], [10]. P. Basu and N. Kashyap are with the Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore. colonel.pranab@gmail.com, nkashyap@ece.iisc.ernet.in /15/$31.00 c 2015 IEEE A notion that has proved to be enormously useful in classical coding is that of linearity. Recall that a linear code is simply a linear subspace of F n q. In particular, a linear code forms an abelian group under the usual componentwise addition over F q. Linear codes have a concise representation in terms of generator and parity-check matrices, which, among other things, lead to relatively simple encoding and decoding algorithms see e.g., [13]. Extending, by analogy, the notion of linearity to subspace codes should prove similarly useful. However, this has proved to be difficult. This is mainly due to one crucial difference between the projective space P q (n) equipped with the subspace distance measure and the Hamming space of F n q equipped with the Hamming distance measure. While Hamming distance is translation-invariant, there is no equivalent notion applicable to projective space as a whole, under subspace distance. Nonetheless, as described in [2], it is possible to define a certain type of linearity in projective space as well. The authors of [2] defined a linear subspace code in P q (n) to be a subset C P q (n) which can be endowed with a binary operation that makes C an abelian group having the property that the subspace distance measure restricted to C is translationinvariant. They gave various constructions of linear codes in P q (n) including one that is generated by basis vectors of the ambient space F n q. A code constructed in this manner was termed a code derived from a fixed basis in [12]. It was conjectured in [2] that a linear subspace code in P q (n) can have at most 2 n codewords. Another conjecture was made about the linear codes in P q (n) that contain F n q as a codeword, which states that any such linear code can have at most ( n k ) k-dimensional codewords, for 0 k n. The last conjecture was very recently proved in [12] using a result of Lovasz [14]. It was also shown that the codes attaining the bound stated in this conjecture must be derived from a fixed basis. However, it should be noted that there are examples of linear codes that do not contain F n q as a codeword, and yet attain the conjectured maximum possible cardinality of 2 n [2]. In this paper, we focus on the class of linear subspace codes which are closed under the usual set/subspace intersection operation, i.e., linear subspace codes with the property that the intersection of any pair of codewords is also a codeword. We describe a method of constructing such codes from partitions of linearly independent subsets of F n q. We say that a code constructed in this manner is derived from a partition of a linearly independent set. Codes derived from a fixed basis form special cases of our construction. We go on to show that
2 any linear subspace code that is closed under intersection must be derived from a partition of a linearly independent set. This yields a complete characterization of this class of subspace codes. From this characterization, it is straightforward to deduce that the conjecture of Braun, Etzion and Vardy [2] on the maximum cardinality of a linear subspace code holds for the class of linear codes closed under intersection. The rest of the paper is organized as follows. Section II introduces the reader to the formal definitions related to linear subspace codes and the conjectures made in [2]. The class of linear codes in P q (n) closed under intersection are defined in Section III and their characterization as codes derived from a partition of a linearly independent set is proved. In Section IV, we study the maximal members of the class of codes of interest to us. It is shown here that the maximal such codes are precisely those that are derived from a fixed basis. Along the way, we show that the maximum cardinality of any linear code closed under intersection is 2 n, thus verifying the Braun-Etzion-Vardy conjecture for this class of subspace codes. Section V contains a few concluding remarks. II. LINEAR CODES IN PROJECTIVE SPACE Braun, Etzion and Vardy [2] introduced a notion of linearity in projective space by abstracting the key properties of linear codes in the Hamming space F n 2. A linear code in P q (n) is defined as follows: Definition 1. A subset U P q (n), with {0} U, is a linear subspace code if the following properties hold: (i) there exists a function : U U U such that (U, ) is an abelian group; (ii) the identity element of (U, ) is {0}; (iii) X X = {0} for every group element X U; (iv) the addition operation is isometric, i.e., d S (X Y 1, X Y 2 ) = d S (Y 1, Y 2 ) for all X, Y 1, Y 2 U. When a subset U of P q (n) satisfies only the first three conditions in the above definition, it is called a quasi-linear code. Note that a quasi-linear code has the structure of a vector space over F 2. As a result, the number of codewords in a quasi-linear code must be a power of 2. In fact, the following proposition was proved by Braun, Etzion and Vardy [2]. Proposition 1. A subset U P q (n), with {0} U, is a quasi-linear code if and only if U is a power of 2. Thus, a subspace code having a vector space structure is not very interesting by itself. It is the requirement that the addition operation be isometric that makes linear subspace codes interesting. The definition of linearity implies certain properties that an isometric linear addition must satisfy. Some of these are listed in the next three lemmas, which are taken from [2]. The first two lemmas follow easily from the definitions; for completeness, we give a proof of the third lemma. Lemma 2. Let U be a linear code in P q (n) and let be the isometric linear addition on U. Then for all X, Y U, we have: dim(x Y ) = d S (X, Y ) = dim X + dim Y 2 dim(x Y ) In particular, if X Y, then dim(x Y ) = dim Y dim X. Lemma 3. For any three subspaces X, Y and Z of a linear code U in P q (n) with isometric linear addition, the condition Z = X Y implies Y = X Z. To state the next lemma, we recall that the sum of two subspaces X and Y of F n q is defined as the subspace X +Y = {x + y : x X, y Y }. Lemma 4. Let U be a linear code in P q (n) and let be the isometric linear addition on U. If X and Y are any two codewords of U such that X Y = {0}, then X Y = X +Y. Proof: From the definition of linearity, we have dim X = dim((x Y ) Y ) = dim(x Y )+dim Y 2 dim((x Y ) Y ) and using the fact X Y = {0}, we also have from Lemma 2 that dim(x Y ) = dim X + dim Y. Combining both, we obtain dim X = dim X+2 dim Y 2 dim((x Y ) Y ), which implies dim Y = dim((x Y ) Y ), i.e., Y (X Y ). Similarly, X (X Y ). This means X + Y X Y. Finally, as X Y = {0}, dim(x + Y ) = dim X + dim Y = dim(x Y ), which proves the lemma. Using the above lemmas, Braun, Etzion and Vardy proved that the definition of linearity restricts the number of onedimensional subspaces that can be included in a linear subspace code. We state their result below without proof. Proposition 5. Let U be a linear code in P q (n) with isometric linear addition. Then U contains at most n of the q n 1 one-dimensional subspaces of F n q. Proposition 5 lends credence to the idea that a linear subspace code U P q (n) cannot have size greater than 2 n. This is because one may reasonably expect the onedimensional codewords of U to form a basis of the F 2 -vector space formed by U. Indeed, Braun, Etzion and Vardy formally conjectured that the cardinality of any linear subspace code in P q (n) can be at most 2 n. They further conjectured, based on empirical evidence, that when F n q is included as a codeword, the code can contain at most ( n k) k-dimensional codewords, for 0 k n. The second conjecture was recently proved in [12], and is stated as a theorem below. The notation U k will henceforth denote the set of all k-dimensional codewords belonging to the linear code U, for 0 k n. Theorem 6 ([12], Theorem 2). If U is a linear code over P q (n) that contains F n q, then U k ( n k) for 0 k n, and hence, U 2 n. Equality holds if and only if U is derived from a fixed basis. The definition of a code derived from a fixed basis is given below for easy reference. Definition 2. A linear subspace code U in P q (n) is derived from a fixed basis if the group (U, ) is generated by n onedimensional subspaces in U.
3 In this paper, we show that the Braun-Etzion-Vardy conjecture on the cardinality of linear subspace codes holds for a certain subclass of codes. This subclass is defined and characterized in the next section. III. LINEAR SUBSPACE CODES CLOSED UNDER INTERSECTION In this section, we explore the class of linear subspace codes in P q (n) that are closed under the usual set intersection operation. We start with the formal definition. Definition 3. A subspace code U P q (n) with the property that X Y U whenever X, Y U is said to be closed under intersection. A linear code in P q (n) closed under intersection can be constructed as described in the next theorem. For a set S F n q, let S denote the subspace of F n q spanned by the elements of S; we specifically define φ = {0}. Theorem 7. Let E = {e 1, e 2,..., e r } be a linearly independent subset of F n q over the field F q and also let {E 1, E 2,..., E m } be a partition of E, i.e., E i E j = φ whenever i j, m i=1 E i = E and E i φ for 1 i m. Define E I := i I E i for any I [m] with E φ := φ, where [m] = {1, 2,..., m}. Then, U = { E I : I [m]} is a linear code in P q (n) that is closed under intersection. Proof: Let us denote the symmetric difference of two sets A and B by A B, i.e., A B := (A B)\(A B). The operation is commutative and associative. For any two elements X and Y of U, define the addition operation on U in the following way. X Y := E IX E IY where X = E IX for all X U, i.e. X is the span of E IX, where I X [m] by construction. Since E is a linearly independent set over F q, choice of E IX is unique for any X U. It is obvious that X Y = E IX E IY = E IX I Y for all X, Y U. The following points are observed. (i) As φ [m], E φ = φ = {0} U. (ii) For any I X, I Y [m], I X I Y is also a subset of [m]. This is because E i s partition the set E and thus for any J [m], either E i E J, or E i E J = φ. Hence X Y = E IX E IY = E IX I Y U for all X, Y U. Moreover, X Y = E IX E IY = E IX I Y = E IY I X = E IY E IX = Y X for all X, Y U, since is commutative. (iii) X X = E IX E IX = {0} for all X U, since S S = φ. (iv) X {0} = E IX φ = E IX = X for all X U. (v) By construction, X Y = E IX E IY = E IX I Y U for all X, Y U, since I X I Y [m] for I X, I Y [m]. (vi) As X Y = E IX E IY, that means E IX Y = E IX E IY for all X, Y U, since any member Z of U is spanned by E IZ where I Z is a unique subset of [m]. Let E I := {j : e j E I }, then the dimension of a member X of U can be calculated as, dim X = E IX. Now d S (X, Y ) = dim X +dim Y 2 dim(x Y ) = E IX + E IY 2 E IX Y = E IX + E IY 2 E IX E IY = E IX E IY for all X, Y U. This implies d S (X Z, Y Z) = E IX Z E IY Z = (E IX E IZ ) (E IY E IZ ) = E IX (E IZ E IZ ) E IY = E IX φ E IY = E IX E IY = d S (X, Y ) for all X, Y, Z U. (i) proves the existence of {0} in the structure. (ii) establishes that {U, } is an abelian group. (iii) and (iv) prove idempotency and additive inverse of that group respectively. (v) shows that the code is closed under intersection. Finally (vi) accounts for translation invariance in the structure, thus proving that U is a linear code in P q (n) that is closed under intersection. Theorem 7 gives us a systematic method of constructing linear subspace codes that are closed under intersection. A code constructed in this manner will be referred to as a code derived from a partition of a linearly independent set. As stated in Theorem 8 below, this is in fact the only means of constructing linear subspace codes closed under intersection. Theorem 8. Let U be a linear subspace code that is closed under intersection. Then, there exist a set of linearly independent vectors E = {e 1, e 2,..., e r } and a partition {E 1, E 2,..., E m } of E such that U = { E I : I [m]}. Theorems 7 and 8 together give a characterization of the class of linear subspace codes that are closed under intersection. Our proof of Theorem 8 requires the notion of indecomposable codewords, which we define next. Definition 4. A codeword Y {0} of a linear subspace code U is said to be indecomposable if Y cannot be expressed as Y 1 Y 2 for any Y 1, Y 2 U with dim Y 1, dim Y 2 < dim Y. The next few lemmas record some important properties of indecomposable codewords that we will use in our proof of Theorem 8. Lemma 9. Let Y be an indecomposable codeword of a linear subspace code U. Then, for any codeword X U, we have X Y iff X = {0} or X = Y. Proof: Suppose that X Y for some X with 0 < dim X < dim Y. Then, we also have dim(x Y ) = dim Y dim X < dim Y. Since we can always write Y = X (X Y ), this means that Y cannot be indecomposable. Lemma 10. If Y 1, Y 2 are any two distinct indecomposable codewords of a linear subspace code U that is closed under intersection, then Y 1 Y 2 = {0}. Consequently, Y 1 Y 2 = Y 1 + Y 2, and dim(y 1 Y 2 ) = dim Y 1 + dim Y 2.
4 Proof: Consider any indecomposable Y 1, Y 2 U with Y 1 Y 2. Obviously Y 1 Y 2 U. By Lemma 9, we cannot have Y 1 Y 2, and so dim(y 1 Y 2 ) < dim(y 1 ). Since Y 1 Y 2 Y 1, we must have Y 1 Y 2 = {0} by Lemma 9 again. The facts about Y 1 Y 2 now follow from Lemma 4. The following generalization of Lemma 10 plays a key role in our proof of Theorem 8. Lemma 11. Let Y 1, Y 2,..., Y m, m 2, be distinct indecomposable codewords of a linear subspace code U that is closed under intersection. Then, (a) for all j [m], Y j i [m]\{j} Y i = {0}; (b) Y 1 Y 2 Y m = Y 1 + Y Y m ; and (c) dim(y 1 Y 2 Y m ) = m i=1 dim(y i). Proof: We prove (a) (c) simultaneously by induction on the number of indecomposable codewords. The base case of two codewords is covered by Lemma 10. As the induction hypothesis, assume that the statements (a) (c) hold for any set of m 1 indecomposable codewords, for some m 3. In particular, for any (m 1)-subset I [m], we have i I Y i = i I Y i and dim( i I Y i ) = i I dim Y i. Now, suppose that (a) does not hold for the given set of m indecomposable codewords Y 1, Y 2,..., Y m. Without loss of generality, assume that Y := Y m (Y Y m 1 ) {0}. By the induction hypothesis, Y 1 + +Y m 1 = Y 1 Y m 1 is in U, and hence, so is Y. Since Y Y m, we have Y = Y m by Lemma 9. Thus, Y m Y Y m 1. This further implies that Y 2 + +Y m 1 +Y m Y 1 + +Y m 1. By the induction hypothesis, this is equivalent to (Y 2 Y m ) (Y 1 Y m 1 ). Now, consider Z = (Y 1 Y m 1 ) (Y 2 Y m ). On the one hand, we have dim Z = dim(y 1 Y m 1 ) dim(y 2 Y m ) by Lemma 2, and hence, applying the induction hypothesis, dim Z = m 1 i=1 dim Y i m dim Y i = dim Y 1 dim Y m. (1) i=2 On the other hand, Z = Y 1 Y m, so that by Lemma 10, dim Z = dim Y 1 + dim Y m, which contradicts (1) since dim Y m 0. Hence, (a) must hold for Y 1, Y 2,..., Y m. The statements (b) and (c) follow easily from (a) by induction using Lemma 4. We are now in a position to prove Theorem 8. Proof of Theorem 8: Let Y 1,..., Y m be a listing of all the distinct indecomposable codewords of U. For each i [m], fix a basis E i of Y i. It follows from Lemma 11(a) that E = m i=1 E i is a linearly independent subset of F n q, and that {E 1,..., E m } constitutes a partition of E. As a consequence, for any I [m], we have E I = i I Y i = i I Y i, the last equality being due to Lemma 11(b). Thus, E I U for all I [m]. To complete the proof, we must show that any codeword X U is of the form E I for some I [m]. This is trivially true if X = Y i for some i [m]. So suppose that X is not indecomposable. Then, it can be decomposed into a sum of the form X 1 X 2 with dim X 1, dim X 2 < dim X. Now, X 1 and X 2 are either indecomposable or can be further decomposed. Carrying on in this manner, X can be decomposed into a sum of the form i I Y i. Hence, X = E I for some I [m], which completes the proof. The proof above used the fact that any codeword X U could be decomposed into a sum of the form i I Y i. Such a decomposition is, in fact, unique. Proposition 12. Let U be a linear subspace code that is closed under intersection, and let Y 1, Y 2,..., Y m be its indecomposable codewords. Then, any codeword X U can be uniquely expressed as i I Y i for some I [m]. Proof: Suppose that X U can be expressed as of indecomposable codewords in two different ways: X = i I Y i = j J Y j for distinct subsets I and J of [m]. Then, upon some reorganization and possible cancellation of like terms, we would obtain for some i I J and some L [m] \ {i}, Y i = l L Y l. By Lemma 11(b), this is the same as Y i = l L Y l, which contradicts Lemma 11(a). From the proof of Theorem 8 (and the statement of Proposition 12), it is clear that any linear subspace code closed under intersection is generated by its indecomposable codewords. This motivates the following definition. Definition 5. The generating set, U G, of a linear subspace code U closed under intersection is the set of all its indecomposable codewords. Note that any one-dimensional codeword of U is indecomposable, and hence is in the generating set. More generally, we have the following strengthening of Lemma 9. Lemma 13. Let U be a linear subspace code closed under intersection. For any Y U, we have Y U G if and only if there is no X U, X {0}, such that X Y. Proof: The only if part holds by Lemma 9. For the if part, assume that Y U is such that for all X U, X Y implies X = {0}. If Y / U G, then by Proposition 12, Y can be expressed as r i=1 Y i for some indecomposable codewords Y 1,..., Y r. Evidently r 2, otherwise Y would itself be in U G. Therefore, by Lemma 11(b), we have Y = r i=1 Y i, which means Y i Y for 1 i r, r 2. Hence, proved by contradiction. The following property of generating sets will be useful in the next section. Lemma 14. Let U and V be two linear subspace codes, each closed under intersection. If U G V G, then U V. Proof: Obviously, if U G V G, then U V. Moreover, U G = V G iff U = V. Remark 1. The converse statement of Lemma 14, namely, that U V implies U G V G, is not true in general. For example, let {e 1, e 2 } be a basis for F 2 q, and consider U G = { e 1, e 2 }
5 and V G = { e 1, e 2 }. We end this section by noting that codes derived from a fixed basis (see Definition 2) form a special case of codes derived from partitions of linearly independent sets. This connection will be explored further in the next section. IV. MAXIMALITY OF LINEAR SUBSPACE CODES CLOSED UNDER INTERSECTION In this section, we prove the conjecture of Braun, Etzion and Vardy [2] for the class of linear subspace codes that are closed under intersection. We also identify the maximal linear subspace codes under the constraint of closure under intersection. Definition 6. A linear code U closed under intersection in P q (n) is said to be maximal if and only if for any other linear code V closed under intersection, U V U = V. We start with a small observation on the dimensions of the indecomposable codewords of any linear subspace code closed under intersection. Lemma 15. If U is a linear code closed under intersection in P q (n) with generating set U G = {Y 1, Y 2,..., Y m }, then m i=1 dim Y i n. Proof: By Proposition 12, the maximum dimension of a codeword in U is dim(y 1 Y 2 Y m ), which equals dim( m i=1 Y i) by Lemma 11. The last sum cannot exceed n since U P q (n), and the lemma is proved. The following result is concerned with the maximality of linear subspace codes closed under intersection. Proposition 16. Let U be a linear subspace code closed under intersection in P q (n) with generating set U G = {Y 1, Y 2,..., Y m }. Then U is maximal only if m i=1 dim Y i = n. Proof: We will show that if m i=1 dim Y i = s < n, then U cannot be maximal. By Lemma 11, we have dim(y 1 Y 2 Y m ) = m i=1 dim Y i = s. Any bases for the Y i s when combined together will form a basis for F s q. This can be extended to a basis of F n q by adding n s more vectors, say {x 1, x 2,..., x n s }, where x j F n q for all 1 j (n s). Consider X = x 1, x 2,..., x n s. If X is added to the generating set U G then by Definition 5 and Proposition 12, V G = {X, Y 1, Y 2,..., Y m } U G is the generating set for another linear subspace code V closed under intersection. By Lemma 14, U cannot be maximal. Thus, if U is maximal, then by Lemma 15, m i=1 dim Y i = n. When a linear subspace code closed under intersection is maximal, it is natural to ask what other constraints are imposed on its structure. The next lemma will give us some answer to this question. Corollary Let U be a linear subspace code closed under intersection in P q (n). Then U is maximal only if F n q U. Proof: Suppose U is maximal. If U G = {Y 1, Y 2,..., Y m } be its generating set then by Proposition 16, dim(y 1 Y 2 Y m ) = m i=1 dim Y i = n and hence, Y 1 Y 2 Y m = F n q U. Let us now prove the conjecture of Braun, Etzion and Vardy for the class of linear subspace codes closed under intersection. Proposition 17. The size of the largest linear subspace code in P q (n) that is closed under intersection is 2 n. Proof: If U is a linear subspace code closed under intersection with Y 1, Y 2,..., Y m being the only indecomposable codewords of U, then according to Lemma 11, dim(y 1 Y 2 Y m ) = dim(y 1 + Y Y m ) = m i=1 dim Y i m and by Lemma 15, m i=1 dim Y i n. Combining both gives m n. Again Proposition 12 states that a codeword of U can be achieved as of some or all of Y 1, Y 2,..., Y m in a unique way. Since the total number of all such possible combinations of Y i s is 2 m, it readily follows that U = 2 m 2 n. Corollary Let U be a linear subspace code in P q (n) closed under intersection such that U = 2 n. Then F n q U. Furthermore, U G = n and dim Y = 1 for all Y U G. Proof: The fact that F n q U follows directly from Proposition 17 and Corollary Using the existence of F n q, it also follows from Theorem 6 that U 1 = n, thus U G n. Finally using Lemma 15, we get the rest. The following result reveals that only the codes derived from a fixed basis can have the maximum cardinality among the class of linear subspace codes closed under intersection. Lemma 18. If U is a linear subspace code in P q (n) closed under intersection, then the size of U is 2 n if and only if U is a code derived from a fixed basis. Proof: If U = 2 n, then U is derived from a fixed basis follows from Theorem 6 and Corollary Conversely, let U be a code derived from a fixed basis, then according to Definition 2, U 1 = n. That means U G = U 1 by Lemma 15 and hence U = 2 n. We conclude this section with the following result which identifies only those linear codes that can attain maximality when subjected to closure under intersection. Proposition 19. Let U be a linear subspace code in P q (n) closed under intersection. Then U is maximal if and only if U is derived from a fixed basis. Proof: If U is a code which is derived from a fixed basis, then by Lemma 18 and Proposition 17, U = 2 n, and therefore it is maximal. Conversely, assume U to be a maximal linear code closed under intersection which is not derived from a fixed basis. According to Corollary 16.1, F n q U and using Theorem 6 as well as Definition 2, U 1 < n, which means U G U 1 by Proposition 16. There must exist some Y U G such that Y / U 1, since U G \U 1 φ. Pick any basis B Y for Y. If B Y = {e 1, e 2,..., e dim Y }, then consider the linear code W closed under intersection and characterized by W G = {U G \Y }
6 { e j } dim Y j=1. Evidently e j / U by Lemma 13 for all 1 j dim Y. On the other hand Y W although Y / W G. Hence, W U, a contradiction to our initial assumption. Therefore, proved. V. CONCLUSION In this paper, we introduced the class of linear subspace codes closed under intersection. We characterized this class of codes in terms of partitions of linearly independent subsets of F n q. We also proved that a linear code closed under intersection is maximal if and only if it is derived from a fixed basis. The conjecture by Braun, Etzion and Vardy [2] on the maximum cardinality of a linear subspace code was shown to be true for the particular case of linear codes closed under intersection. However, the general conjecture that any linear subspace code has a maximum cardinality of 2 n is yet to be resolved and would be an interesting problem for future research. REFERENCES [1] R. Koetter and F. Kschischang, Coding for errors and erasures in random network coding, IEEE Trans. Inform. Theory, vol. 54, pp , Aug [2] M. Braun, T. Etzion and A. Vardy, Linearity and complements in projective space, Linear Algebra and Its Applications, vol. 438, no. 1, pp , [3] T. Etzion and A. Vardy, Error-correcting codes in projective space, IEEE Trans. Inform. Theory, vol. 57, pp , Feb [4] T. Etzion and N. Silberstein, Error-correcting codes in projective space via rank-metric codes and Ferrers diagrams, IEEE Trans. Inform. Theory, vol. 55, pp , July [5] N. Silberstein and T. Etzion, Enumerative coding for Grassmannian space, IEEE Trans. Inform. Theory, vol. 57, no. 1, pp , January [6] M. Gadouleau and Z. Yan, Packing and covering properties of subspace codes for error control in random linear network coding, IEEE Trans. Inform. Theory, vol. 56, no. 5, pp , May [7] A-L. Trautmann, F. Manganiello, M. Braun and J. Rosenthal, Cyclic orbit codes, IEEE Trans. Inform. Theory, vol. 59, no. 11, pp , Nov [8] S.T. Xia and F.W. Fu, Johnson type bounds on constant dimension codes, Designs, Codes, Crypto., vol. 50, pp , [9] A. Kohnert and S. Kurz, Construction of large constant dimension codes with a prescribed minimum distance, Lecture Notes in Computer Science, vol. 5393, pp , [10] M. Gadouleau and Z. Yan, Constant-rank codes and their connection to constant-dimension codes, IEEE Trans. Inform. Theory, vol. 56, pp , July [11] S.B. Pai and B.S. Rajan, A lattice Singleton bound, Proc IEEE Int. Symp. Inf. Theory (ISIT 2013), pp [12] S.B. Pai and B.S. Rajan, On the bounds of certain maximal linear codes in a projective space, ArXiv: [13] F.J. Macwilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North Holland Publishing Co., [14] L. Lovasz, Flats in matroids and geometric graphs, Combinatorial Surveys: Proceedings of the Sixth British Combinatorial Conference, pp , 1977.
A 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
Codes and Designs in the Grassmann Scheme
Codes and Designs in the Grassmann Scheme Tuvi Etzion Computer Science Department Technion -Israel Institute of Technology etzion@cs.technion.ac.il ALGEBRAIC COMBINATORICS AND APPLICATIONS ALCOMA10, Thurnau,
Enumerative Encoding in the Grassmannian Space
Enumerative Encoding in the Grassmannian Space Natalia Silberstein Department of omputer Science Technion-Israel Institute of Technology Haifa 3 Israel Email: natalys@cstechnionacil Tuvi Etzion Department
Week 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
Constructing network codes using Möbius transformations
Constructing network codes using Möbius transformations Andreas-Stephan Elsenhans and Axel Kohnert November 26, 2010 Abstract We study error correcting constant dimension subspace codes for network coding.
arxiv: v1 [cs.it] 25 Mar 2010
LARGE CONSTANT DIMENSION CODES AND LEXICODES arxiv:1003.4879v1 [cs.it] 25 Mar 2010 Natalia Silberstein Computer Science Department Technion - Israel Institute of Technology Haifa, Israel, 32000 Tuvi Etzion
The 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
Matrix 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
Fundamentals of Coding For Network Coding
Fundamentals of Coding For Network Coding Marcus Greferath and Angeles Vazquez-Castro Aalto University School of Sciences, Finland Autonomous University of Barcelona, Spain marcus.greferath@aalto.fi and
ON LINEAR CODES WHOSE WEIGHTS AND LENGTH HAVE A COMMON DIVISOR. 1. Introduction
ON LINEAR CODES WHOSE WEIGHTS AND LENGTH HAVE A COMMON DIVISOR SIMEON BALL, AART BLOKHUIS, ANDRÁS GÁCS, PETER SZIKLAI, AND ZSUZSA WEINER Abstract. In this paper we prove that a set of points (in a projective
Explicit 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
LET 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
The cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
On designs and Steiner systems over finite fields
On designs and Steiner systems over finite fields Alfred Wassermann Department of Mathematics, Universität Bayreuth, Germany Special Days on Combinatorial Construction Using Finite Fields, Linz 2013 Outline
11 Minimal Distance and the Parity Check Matrix
MATH32031: Coding Theory Part 12: Hamming Codes 11 Minimal Distance and the Parity Check Matrix Theorem 23 (Distance Theorem for Linear Codes) Let C be an [n, k] F q -code with parity check matrix H. Then
Vector 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
Decomposing Bent Functions
2004 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 8, AUGUST 2003 Decomposing Bent Functions Anne Canteaut and Pascale Charpin Abstract In a recent paper [1], it is shown that the restrictions
The 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
Linear Algebra. Chapter 5
Chapter 5 Linear Algebra The guiding theme in linear algebra is the interplay between algebraic manipulations and geometric interpretations. This dual representation is what makes linear algebra a fruitful
On Cryptographic Properties of the Cosets of R(1;m)
1494 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 4, MAY 2001 On Cryptographic Properties of the Cosets of R(1;m) Anne Canteaut, Claude Carlet, Pascale Charpin, and Caroline Fontaine Abstract
On Locating-Dominating Codes in Binary Hamming Spaces
Discrete Mathematics and Theoretical Computer Science 6, 2004, 265 282 On Locating-Dominating Codes in Binary Hamming Spaces Iiro Honkala and Tero Laihonen and Sanna Ranto Department of Mathematics and
A 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,
An 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
Tropical matrix algebra
Tropical matrix algebra Marianne Johnson 1 & Mark Kambites 2 NBSAN, University of York, 25th November 2009 1 University of Manchester. Supported by CICADA (EPSRC grant EP/E050441/1). 2 University of Manchester.
Filters in Analysis and Topology
Filters in Analysis and Topology David MacIver July 1, 2004 Abstract The study of filters is a very natural way to talk about convergence in an arbitrary topological space, and carries over nicely into
On 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,
Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
Open Questions in Coding Theory
Open Questions in Coding Theory Steven T. Dougherty July 4, 2013 Open Questions The following questions were posed by: S.T. Dougherty J.L. Kim P. Solé J. Wood Hilbert Style Problems Hilbert Style Problems
0.2 Vector spaces. J.A.Beachy 1
J.A.Beachy 1 0.2 Vector spaces I m going to begin this section at a rather basic level, giving the definitions of a field and of a vector space in much that same detail as you would have met them in a
Feedback Capacity of a Class of Symmetric Finite-State Markov Channels
Feedback Capacity of a Class of Symmetric Finite-State Markov Channels Nevroz Şen, Fady Alajaji and Serdar Yüksel Department of Mathematics and Statistics Queen s University Kingston, ON K7L 3N6, Canada
General error locator polynomials for binary cyclic codes with t 2 and n < 63
General error locator polynomials for binary cyclic codes with t 2 and n < 63 April 22, 2005 Teo Mora (theomora@disi.unige.it) Department of Mathematics, University of Genoa, Italy. Emmanuela Orsini (orsini@posso.dm.unipi.it)
2. Introduction to commutative rings (continued)
2. Introduction to commutative rings (continued) 2.1. New examples of commutative rings. Recall that in the first lecture we defined the notions of commutative rings and field and gave some examples of
On the representability of the bi-uniform matroid
On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 1, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large
Parameterizing orbits in flag varieties
Parameterizing orbits in flag varieties W. Ethan Duckworth April 2008 Abstract In this document we parameterize the orbits of certain groups acting on partial flag varieties with finitely many orbits.
Some Bounds for the Distribution Numbers of an Association Scheme
Europ. J. Combinatorics (1988) 9, 1-5 Some Bounds for the Distribution Numbers of an Association Scheme THOMAS BIER AND PHILIPPE DELSARTE We generalize the definition of distribution numbers of an association
A proof of the Jordan normal form theorem
A proof of the Jordan normal form theorem Jordan normal form theorem states that any matrix is similar to a blockdiagonal matrix with Jordan blocks on the diagonal. To prove it, we first reformulate it
i=1 α ip i, where s The analogue of subspaces
Definition: Let X = {P 1,...,P s } be an affine basis for A. If we write P = s i=1 α ip i, where s i=1 α i = 1 then the uniquely determined coefficients, α i, are called the barycentric coordinates of
Improved Upper Bounds on Sizes of Codes
880 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 4, APRIL 2002 Improved Upper Bounds on Sizes of Codes Beniamin Mounits, Tuvi Etzion, Senior Member, IEEE, and Simon Litsyn, Senior Member, IEEE
Isomorphisms between pattern classes
Journal of Combinatorics olume 0, Number 0, 1 8, 0000 Isomorphisms between pattern classes M. H. Albert, M. D. Atkinson and Anders Claesson Isomorphisms φ : A B between pattern classes are considered.
Elementary 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
DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
COMMON COMPLEMENTS OF TWO SUBSPACES OF A HILBERT SPACE
COMMON COMPLEMENTS OF TWO SUBSPACES OF A HILBERT SPACE MICHAEL LAUZON AND SERGEI TREIL Abstract. In this paper we find a necessary and sufficient condition for two closed subspaces, X and Y, of a Hilbert
Support weight enumerators and coset weight distributions of isodual codes
Support weight enumerators and coset weight distributions of isodual codes Olgica Milenkovic Department of Electrical and Computer Engineering University of Colorado, Boulder March 31, 2003 Abstract In
Spanning and Independence Properties of Finite Frames
Chapter 1 Spanning and Independence Properties of Finite Frames Peter G. Casazza and Darrin Speegle Abstract The fundamental notion of frame theory is redundancy. It is this property which makes frames
Coding 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.
Progress 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
The Witt designs, Golay codes and Mathieu groups
The Witt designs, Golay codes and Mathieu groups 1 The Golay codes Let V be a vector space over F q with fixed basis e 1,..., e n. A code C is a subset of V. A linear code is a subspace of V. The vector
Chapter 2 Linear Transformations
Chapter 2 Linear Transformations Linear Transformations Loosely speaking, a linear transformation is a function from one vector space to another that preserves the vector space operations. Let us be more
Commuting nilpotent matrices and pairs of partitions
Commuting nilpotent matrices and pairs of partitions Roberta Basili Algebraic Combinatorics Meets Inverse Systems Montréal, January 19-21, 2007 We will explain some results on commuting n n matrices and
Linear Algebra. Paul Yiu. Department of Mathematics Florida Atlantic University. Fall 2011
Linear Algebra Paul Yiu Department of Mathematics Florida Atlantic University Fall 2011 Linear Algebra Paul Yiu Department of Mathematics Florida Atlantic University Fall 2011 1A: Vector spaces Fields
Hamming codes and simplex codes ( )
Chapter 6 Hamming codes and simplex codes (2018-03-17) Synopsis. Hamming codes are essentially the first non-trivial family of codes that we shall meet. We start by proving the Distance Theorem for linear
Knowledge spaces from a topological point of view
Knowledge spaces from a topological point of view V.I.Danilov Central Economics and Mathematics Institute of RAS Abstract In this paper we consider the operations of restriction, extension and gluing of
Representations of quivers
Representations of quivers Gwyn Bellamy October 13, 215 1 Quivers Let k be a field. Recall that a k-algebra is a k-vector space A with a bilinear map A A A making A into a unital, associative ring. Notice
Construction of Barnes-Wall Lattices from Linear Codes over Rings
01 IEEE International Symposium on Information Theory Proceedings Construction of Barnes-Wall Lattices from Linear Codes over Rings J Harshan Dept of ECSE, Monh University Clayton, Australia Email:harshanjagadeesh@monhedu
Tilings of Binary Spaces
Tilings of Binary Spaces Gérard Cohen Département Informatique ENST, 46 rue Barrault 75634 Paris, France Simon Litsyn Department of Electrical Engineering Tel-Aviv University Ramat-Aviv 69978, Israel Alexander
THE LARGEST INTERSECTION LATTICE OF A CHRISTOS A. ATHANASIADIS. Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin.
THE LARGEST INTERSECTION LATTICE OF A DISCRIMINANTAL ARRANGEMENT CHRISTOS A. ATHANASIADIS Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin. 6 (1997), 229{246] about the \largest" intersection
Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound 5th ICMCTA Vihula Manor, 28-31 August 2017 Daniel Heinlein University of Bayreuth, Germany Daniel.Heinlein@uni-bayreuth.de
LECTURE 25-26: CARTAN S THEOREM OF MAXIMAL TORI. 1. Maximal Tori
LECTURE 25-26: CARTAN S THEOREM OF MAXIMAL TORI 1. Maximal Tori By a torus we mean a compact connected abelian Lie group, so a torus is a Lie group that is isomorphic to T n = R n /Z n. Definition 1.1.
(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d
The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers
MATH32031: 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,
A classification of MDS binary systematic codes
A classification of MDS binary systematic codes Eleonora Guerrini (guerrini@science.unitn.it) Department of Mathematics, University of Trento, Italy. Massimiliano Sala (msala@bcri.ucc.ie) Boole Centre
JORDAN NORMAL FORM. Contents Introduction 1 Jordan Normal Form 1 Conclusion 5 References 5
JORDAN NORMAL FORM KATAYUN KAMDIN Abstract. This paper outlines a proof of the Jordan Normal Form Theorem. First we show that a complex, finite dimensional vector space can be decomposed into a direct
Lecture 17: Perfect Codes and Gilbert-Varshamov Bound
Lecture 17: Perfect Codes and Gilbert-Varshamov Bound Maximality of Hamming code Lemma Let C be a code with distance 3, then: C 2n n + 1 Codes that meet this bound: Perfect codes Hamming code is a perfect
Extending MDS Codes. T. L. Alderson
Extending MDS Codes T. L. Alderson Abstract A q-ary (n,k)-mds code, linear or not, satisfies n q + k 1. A code meeting this bound is said to have maximum length. Using purely combinatorial methods we show
A Combinatorial Bound on the List Size
1 A Combinatorial Bound on the List Size Yuval Cassuto and Jehoshua Bruck California Institute of Technology Electrical Engineering Department MC 136-93 Pasadena, CA 9115, U.S.A. E-mail: {ycassuto,bruck}@paradise.caltech.edu
1 Invariant subspaces
MATH 2040 Linear Algebra II Lecture Notes by Martin Li Lecture 8 Eigenvalues, eigenvectors and invariant subspaces 1 In previous lectures we have studied linear maps T : V W from a vector space V to another
Math 249B. Geometric Bruhat decomposition
Math 249B. Geometric Bruhat decomposition 1. Introduction Let (G, T ) be a split connected reductive group over a field k, and Φ = Φ(G, T ). Fix a positive system of roots Φ Φ, and let B be the unique
arxiv: v2 [math.ag] 24 Jun 2015
TRIANGULATIONS OF MONOTONE FAMILIES I: TWO-DIMENSIONAL FAMILIES arxiv:1402.0460v2 [math.ag] 24 Jun 2015 SAUGATA BASU, ANDREI GABRIELOV, AND NICOLAI VOROBJOV Abstract. Let K R n be a compact definable set
10. Smooth Varieties. 82 Andreas Gathmann
82 Andreas Gathmann 10. Smooth Varieties Let a be a point on a variety X. In the last chapter we have introduced the tangent cone C a X as a way to study X locally around a (see Construction 9.20). It
PROJECTIVE DIVISIBLE BINARY CODES
PROJECTIVE DIVISIBLE BINARY CODES DANIEL HEINLEIN, THOMAS HONOLD, MICHAEL KIERMAIER, SASCHA KURZ, AND ALFRED WASSERMANN Abstract. For which positive integers n, k, r does there exist a linear [n, k] code
Message Encoding and Retrieval for Spread and Cyclic Orbit Codes
Message Encoding and Retrieval for Spread and Cyclic Orbit Codes Anna-Lena Trautmann, Member, IEEE Department of Electrical and Electronic Engineering University of Melbourne, Australia Department of Electrical
Introduction to Association Schemes
Introduction to Association Schemes Akihiro Munemasa Tohoku University June 5 6, 24 Algebraic Combinatorics Summer School, Sendai Assumed results (i) Vandermonde determinant: a a m =. a m a m m i
Coding for Errors and Erasures in Random Network Coding
Coding for Errors and Erasures in Random Network Coding arxiv:cs/0703061v2 [cs.it] 25 Mar 2008 Ralf Kötter Institute for Communications Engineering TU Munich D-80333 Munich ralf.koetter@tum.de Frank R.
Low-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
Extended 1-perfect additive codes
Extended 1-perfect additive codes J.Borges, K.T.Phelps, J.Rifà 7/05/2002 Abstract A binary extended 1-perfect code of length n + 1 = 2 t is additive if it is a subgroup of Z α 2 Zβ 4. The punctured code
Min-Rank Conjecture for Log-Depth Circuits
Min-Rank Conjecture for Log-Depth Circuits Stasys Jukna a,,1, Georg Schnitger b,1 a Institute of Mathematics and Computer Science, Akademijos 4, LT-80663 Vilnius, Lithuania b University of Frankfurt, Institut
On the Baum-Connes conjecture for Gromov monster groups
On the Baum-Connes conjecture for Gromov monster groups Martin Finn-Sell Fakultät für Mathematik, Oskar-Morgenstern-Platz 1, 1090 Wien martin.finn-sell@univie.ac.at June 2015 Abstract We present a geometric
Lecture Notes 1: Vector spaces
Optimization-based data analysis Fall 2017 Lecture Notes 1: Vector spaces In this chapter we review certain basic concepts of linear algebra, highlighting their application to signal processing. 1 Vector
Cover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/1887/57796 holds various files of this Leiden University dissertation Author: Mirandola, Diego Title: On products of linear error correcting codes Date: 2017-12-06
Congruence Boolean Lifting Property
Congruence Boolean Lifting Property George GEORGESCU and Claudia MUREŞAN University of Bucharest Faculty of Mathematics and Computer Science Academiei 14, RO 010014, Bucharest, Romania Emails: georgescu.capreni@yahoo.com;
A completely entangled subspace of maximal dimension
isibang/ms/2006/6 March 28th, 2006 http://www.isibang.ac.in/ statmath/eprints A completely entangled subspace of maximal dimension B. V. Rajarama Bhat Indian Statistical Institute, Bangalore Centre 8th
Chapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
arxiv: v1 [cs.it] 18 Jan 2012
Noname manuscript No. (will be inserted by the editor) A Complete Characterization of Irreducible Cyclic Orbit Codes and their Plücker Embedding Joachim Rosenthal Anna-Lena Trautmann arxiv:1201.3825v1
On the intersection of infinite matroids
On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of
2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
BLOCKS IN THE CATEGORY OF FINITE-DIMENSIONAL REPRESENTATIONS OF gl(m n)
BLOCKS IN THE CATEGORY OF FINITE-DIMENSIONAL REPRESENTATIONS OF gl(m n) VERA SERGANOVA Abstract. We decompose the category of finite-dimensional gl (m n)- modules into the direct sum of blocks, show that
IMA Preprint Series # 2066
THE CARDINALITY OF SETS OF k-independent VECTORS OVER FINITE FIELDS By S.B. Damelin G. Michalski and G.L. Mullen IMA Preprint Series # 2066 ( October 2005 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
REPRESENTATION THEORY. WEEKS 10 11
REPRESENTATION THEORY. WEEKS 10 11 1. Representations of quivers I follow here Crawley-Boevey lectures trying to give more details concerning extensions and exact sequences. A quiver is an oriented graph.
Properties and Classification of the Wheels of the OLS Polytope.
Properties and Classification of the Wheels of the OLS Polytope. G. Appa 1, D. Magos 2, I. Mourtos 1 1 Operational Research Department, London School of Economics. email: {g.appa, j.mourtos}@lse.ac.uk
Permutation 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
CYCLIC SIEVING FOR CYCLIC CODES
CYCLIC SIEVING FOR CYCLIC CODES ALEX MASON, VICTOR REINER, SHRUTHI SRIDHAR Abstract. These are notes on a preliminary follow-up to a question of Jim Propp, about cyclic sieving of cyclic codes. We show
Rank and Kernel of binary Hadamard codes.
1 Rank and Kernel of binary Hadamard codes. K.T. Phelps, J. Rifà Senior Member IEEE, M. Villanueva Abstract In this paper the rank and the dimension of the kernel for (binary) Hadamard codes of length
Characterizations of the finite quadric Veroneseans V 2n
Characterizations of the finite quadric Veroneseans V 2n n J. A. Thas H. Van Maldeghem Abstract We generalize and complete several characterizations of the finite quadric Veroneseans surveyed in [3]. Our
Linear 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,
Contents. Index... 15
Contents Filter Bases and Nets................................................................................ 5 Filter Bases and Ultrafilters: A Brief Overview.........................................................
An 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
CHAPTER 1. AFFINE ALGEBRAIC VARIETIES
CHAPTER 1. AFFINE ALGEBRAIC VARIETIES During this first part of the course, we will establish a correspondence between various geometric notions and algebraic ones. Some references for this part of the
Arrangements, 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
Linear Algebra 2 Spectral Notes
Linear Algebra 2 Spectral Notes In what follows, V is an inner product vector space over F, where F = R or C. We will use results seen so far; in particular that every linear operator T L(V ) has a complex
Groups of Prime Power Order with Derived Subgroup of Prime Order
Journal of Algebra 219, 625 657 (1999) Article ID jabr.1998.7909, available online at http://www.idealibrary.com on Groups of Prime Power Order with Derived Subgroup of Prime Order Simon R. Blackburn*