Fundamentals of Coding For Network Coding
|
|
- Cynthia Joseph
- 6 years ago
- Views:
Transcription
1 Fundamentals of Coding For Network Coding Marcus Greferath and Angeles Vazquez-Castro Aalto University School of Sciences, Finland Autonomous University of Barcelona, Spain and 2016
2 Structure of the Presentation Projective Geometry Traditional Designs q -Analogs of Designs Subspace Codes Computational Methods Further Results 2/41
3 Structure of the Presentation Projective Geometry Traditional Designs q -Analogs of Designs Subspace Codes Computational Methods Further Results 3/41
4 Has anybody ever seen this figure? One of the best known images in Discrete Mathematics It is an illustration of the so-called Fano plane. 4/41
5 Projective Geometry The Fano plane is the smallest non-trivial example of what is called a projective space. These geometries are incidence structures (P, G) consisting of points and lines, such that the following 3 axioms are satisfied: Any two (distinct) points are contained in a unique line. If a line intersects with two sides of a triangle (but not in the vertices), then it will also intersect with the third side. There are at least 4 points, no 3 of which are on a common line. 5/41
6 Projective Geometry A large class of projective spaces comes from vector spaces: Let V be a vector space of dimension at least 3 over the field F. Define (P, G) by P := {U V dim(u) = 1} G := {U V dim(u) = 2} Then the pair (P, G) indeed satisfies the above 3 axioms. More-over, if V = F 3 2, then the above image of the Fano plane describes the structure of (P, G). 6/41
7 Projective Geometry Finally, there is a notion of dimension, that arises as follows: A subspace is a subset A of P such that with every two points p, q A the entire line spanned by p and q will be also contained in A. It can be seen that arbitrary intersections of subspaces again form subspaces. If B is an arbitrary subset of P, then [B] := {B A P A subspace}, i.e. the smallest subspace containing B is called the subspace generated by B. 7/41
8 Projective Geometry The dimension of a subspace A is then the size of the smallest subset generating A, reduced by 1. This way, we have the following further concepts: Singletons are the subspaces of dimension 0. Lines are subspaces of dimension 1. Planes are subspaces of dimension Hyperplanes are subspaces of dimension n 1, provided the given projective space is of dimension n. 8/41
9 Projective Geometry The set of all subspaces of a projective space (P, G), partially ordered by set inclusion, is called the projective geometry of (P, G). 9/41
10 Structure of the Presentation Projective Geometry Traditional Designs q -Analogs of Designs Subspace Codes Computational Methods Further Results 10/41
11 Subset lattice Let X be a v -element set. ( X ) k := Set of all k -subsets of X. # ( ) ( X k = v k). Subsets of X form a Boolean lattice (wrt. ). Definition D ( X k ) is a t -(v, k, λ) (block) design if each T ( X t ) is contained in exactly λ blocks (elements of D ). If λ = 1: D is called a Steiner system For λ = 1, t = 2, k = 3, D is referred to as a Steiner triple system STS(v) 11/41
12 Example X = {1, 2, 3, 4, 5, 6, 7}, D = {{1, 2, 5}, {1, 4, 6} {1, 3, 7}, {2, 3, 6}, {2, 4, 7}, {3, 4, 5}, {5, 6, 7}} Fano plane D is a 2-(7, 3, 1) design, i.e an STS(7). 12/41
13 Lemma Let D be a t -(v, k, λ) design and i {0,..., t}. Then D is also an i -(v, k, λ i ) design with Example λ i = ( v i t i ( k i t i ) ) λ. In particular, #D = λ 0 Fano plane STS(7) (v = 7, k = 3, t = 2, λ = 1): λ 2 = 1, λ 1 = 3, λ 0 = 7 Corollary: Integrality conditions If a t -(v, k, λ) design exists, then λ 0, λ 1,..., λ t Z, i.e. all these Parameters must be admissible. 13/41
14 Remark All finite projective spaces are Steiner systems. The underlying 2-designs have parameters ( qn 1 q 1, q + 1, 1). Here q is the number of elements in the finite field, and n is the dimension of the vector space. Lemma STS(v) admissible v 1, 3 (mod 6). STS(v) for small v Fano plane STS(7) is smallest (non-trivial) example. Next admissible case is STS(9) which exists as affine plane of order 3. Theorem (Kirkman 1847) All admissible STS(v) do exist. 14/41
15 Subspace lattice Let V be a v -dimensional F q vector space. Grassmannian [ ] V k := Set of all k -dim. subspaces of V. q Gaussian Binomial coefficient [ ] [ ] V v # = = (qv 1)(q v 1 1)... (q v k+1 1) k k (q 1)(q 2 1)... (q k 1) q q Subspace lattice of V = projective geometry PG(v 1, q) [ Elements of V ] 1 are points. q [ Elements of V ] 2 are lines. q Elements of [ ] V 3 are planes. q [ Elements of V ] v 1 are hyperplanes. q 15/41
16 Structure of the Presentation Projective Geometry Traditional Designs q -Analogs of Designs Subspace Codes Computational Methods Further Results 16/41
17 How to obtain q -analogs in combinatorics? Replace subset lattice by subspace lattice! traditional q-analog v-element set X v-dim. F q vector spacev ) [ V ] k ( V k ( v k ) [ v k] cardinality dimension + The subset lattice corresponds to the limit when q 1. A groaner: This comes from the unary field F 1. q q 17/41
18 What is the definition of a q -analog of a design? We follow the above recipe and make the transit from sets to vector spaces: Definition (subspace design) Let V be a v -dimensional F q vector space. D [ ] V k q is a t -(v, k, λ) q (subspace) design if each T [ ] V t is contained in q exactly λ elements of D. If λ = 1: D is called a q -Steiner system If λ = 1, t = 2, k = 3: D is referred to as q -Steiner triple system STS q (v) Geometrically, the STS q (v) is a set of planes in PG(v 1, q) which cover each line exactly once. 18/41
19 Lemma Let D be a t -(v, k, λ) q design and i {0,..., t}. Then D is also an i -(v, k, λ i ) q design with λ i = [ v i ] t i q [ k i ] t i q λ. In particular, #D = λ 0. Corollary: Integrality conditions If a t -(v, k, λ) q design exists, then λ 0, λ 1,..., λ t Z, i.e. all of these Parameters must be admissible 19/41
20 Lemma STS q (v) admissible v 1, 3 (mod 6). STS q (v) for small v The famous q -analog of the Fano plane STS q (7). Problem: its existence is open for every field order q. STS q (9) which could be called the q -analog of the binary affine plane. Problem: its existence is open for every q. Good News: A non-trivial q -Steiner system is known to exist: STS 2 (13) and was discovered by Braun, Etzion, Ostergard, Vardy, Wassermann in /41
21 Focus on binary q -analog of the Fano plane STS 2 (7). λ 2 = 1, λ 1 = 21, λ 0 = 381 STS 2 (7) consists of λ 0 = 381 blocks which need to be found in a set of [ ] 7 3 = planes of that projective 2 space! This is a huge search space, as ( ) has 730 decimal digits. Additional properties and insight is required! Through each point P there are λ 1 = 21 blocks. Image in V /P = PG(5, 2) is a line spread, (cf. Mateva, Topalova 2009): There are types of spreads. More refined information by intersection numbers (see Kiermaier and Pavcevic 2014). 21/41
22 Structure of the Presentation Projective Geometry Traditional Designs q -Analogs of Designs Subspace Codes Computational Methods Further Results 22/41
23 Definition (Recall: Steiner system) D [ ] V k q is a t -(v, k, 1) q Steiner system if each T [ ] V t is contained in exactly one element of D. q Definition ((constant dimension) subspace code) C [ ] V k q is a (v, 2(k t + 1); k) q subspace code if each T [ ] V t is contained in at most one element of C. q q -Fano setting: (7, 4; 3) q subspace code C. For q = 2: #C 381 #C = 381 C is a STS2 (7) Task: Find maximum size A q (7, 4; 3) of (7, 4; 3) q subspace code! 23/41
24 History Silberstein 2008: A 2 (7, 4; 3) 289 Based on lifted rank metric codes. Vardy 2008: A 2 (7, 4; 3) 294 Kohnert, Kurz 2008: A 2 (7, 4; 3) 304 Prescribe group of order 21 Braun, Reichelt 2012: A 2 (7, 4; 3) 329 Prescribe group of order 15, modify large solutions. Liu, Honold 2014; Honold, K. 2015: explicit construction of #C = 329 via expurgation and augmentation of the lifted Gabidulin code More-over: A 3 (7, 4; 3) 6977 for q = 3 (which means STS 3 (7) would have size 7651.) 24/41
25 Recent approach joint work with Daniel Heinlein, Sascha Kurz and Alfred Wassermann. Systematically check G < GL(7, 2) for admitting large G-invariant codes. Found #G = 64 admitting #C = having a subgroup of order 32 admitting #C = having a subgroup of order 16 admitting #C = having a subgroup of order 4 admitting #C = 333. Code provided at subspacecodes.uni-bayreuth.de 25/41
26 Structure of the Presentation Projective Geometry Traditional Designs q -Analogs of Designs Subspace Codes Computational Methods Further Results 26/41
27 Automorphisms Designs over sets: S v : symmetric group σ S v is automorphism: B σ = B d c Example: 4 2 σ = (ad)(bc) a b Set of automorphisms: automorphism group Subspace designs: PGL(v, q) projective semilinear group GL(v, q) = {M F v v q : M invertible} σ PGL(v, q) automorphism: B σ = B 27/41
28 Brute force approach for construction Step 1: Build matrix Designs over sets: incidence matrix between t -subset T i and k -subsets K j : M t,k = (m i,j ), where m i,j = { 1 if T i K j 0 else Subspace designs: incidence matrix between t -subspaces T i and k -subspaces K j : M t,k = (m i,j ), where m i,j = M t,k = [ v t ]q [ ] v k q { 1 if T i K j 0 else 28/41
29 Brute force approach for construction Step 2: Solve system of Diophantine linear equations Solve M t,k x 1 x 2. x n = λ λ. λ Here x = [x 1,..., x n ] T is a binary vector. 29/41
30 Example 3 d a 1 design 1 3 d 5 4 a 6 1 c b c 2 b 4 d a design 2 c b 2 d a 5 6 design 3 M 1, a b c d design design design c b 30/41
31 Side remark: Linear codes Search for linear [n, k, d] q code Ambient space F k q Build incidence matrix between k 1-subspaces H i and 1-subspaces P j : { 1 if H i P j M k 1,1 = (m i,j ), where m i,j = 0 else Solve M t,k x n d n d. n d with 0/1-vector x, x 1 = n 31/41
32 Designs with prescribed automorphism group Construction of designs with prescribed automorphism group: choose group G acting on X, i.e. G S v search for t -designs D = (X, B) having G as a group of automorphisms, i.e. for all g G and K B = K g B construct D = (X, B) as union of orbits of G on k -subsets. 32/41
33 Example: cyclic symmetry d 4 a c 2 b a b c d d 5 c {1, 2, 3, 4} {5, 6} a 2 1 b 2 1 c 2 1 d 2 1 a design 3 6 b {1, 2, 3, 4} {5, 6} {a, b, c, d} /41
34 The method of Kramer and Mesner Definition K X and K = k : K G := {K g g G} T X and T = t : T G := {T g g G} Let and K G 1 K G 2... K G n T G 1 T G 2... T G m = ( ) X k ( ) X t M G t,k = (m i,j) where m i,j := {K K G j T i K } 34/41
35 The method of Kramer and Mesner Theorem (Kramer and Mesner, 1976) The union of orbits corresponding to the 1s in a {0, 1} vector which solves λ Mt,k G x = λ. λ is a t -(v, k, λ) design having G as an automorphism group. Expected gain Brute force approach: M t,k = [ v t ]q [ ] v k q Kramer-Mesner: Mt,k G [v t] q G [v k] q G 35/41
36 Applications of Kramer-Mesner mostly by Betten, Braun, Kerber, Kiermaier, Kohnert, Kurz, Laue, Vogel, W., Zwanzger at Bayreuth University designs over sets subspace designs large sets of designs subspace codes linear codes self-orthogonal codes LCD codes ring-linear codes two-weight codes arcs, blocking sets in projective geometry 36/41
37 Solving algorithms t -designs with λ = 1: maximum clique algorithms (Östergård: cliquer) exact cover (Knuth: dancing links) t -designs with λ > 1: integer programming (CPLEX, Gurobi) heuristic algorithms Logic programming Gröbner bases lattice basis reduction + exhaustive enumeration (W. 1998, 2002) 37/41
38 Structure of the Presentation Projective Geometry Traditional Designs q -Analogs of Designs Subspace Codes Computational Methods Further Results 38/41
39 Subspace designs by computer construction (q = 2, t 2) Braun, Kerber, Laue (2005), S. Braun (2010), Braun, Etzion, Östergård, Vardy, W. (2013), M. Braun (2015) t-(v, k, λ; q) M G t,k λ 3-(8, 4, λ; 2) , 15 2-(13, 3, λ; 2) ,..., (11, 3, λ; 2) , (10, 3, λ; 2) , 30, 45, 60, 75, 90, 105, (9, 4, λ; 2) , 63, 84, 126, 147, 189, 210, 252, 273, 315, 336, 378, 399, 441, 462, 504, 525, 567, 576, 588, 630, 651, 693, 714, 756, 777, 819, 840, 882, 903, 945, 966, 1008, 1029, 1071, 1092, 1134, 1155, 1197, 1218, 1260, 1281, (9, 3, λ; 2) , 22, 42, 43, , 12, 19, 24, 31, 36, 43, 48, 55, (8, 4, λ; 2) , 35, 56, 70, 91, 105, 126, 140, 161, 175, 196, 210, 231, 245, 266, 280, 301, , 14, 49, 56, 63, 98, 105, 112, 147, 154, , 203, 210, 245, 252, 259, 294, 301, (8, 3, λ; 2) (7, 3, λ; 2) , 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 2-(6, 3, λ; 2) , 6 All beside 2-(13, 3, λ; 2) were found by solvediophant 39/41
40 Back to the (binary) Fano plane Does a 2-(7, 3, 1; q) design exist for q 2? Theorem (Braun, Kiermaier, Nakić (2016)) A binary Fano plane can have four non-trivial automorphism groups: One group of order 2, two groups of order 3, one group of order 4. Theorem (Kiermaier, Kurz, W. (2016)) The order of the automorphism group of a binary q-analog of the Fano plane is at most two. 40/41
41 Thanks to M. Kiermaier and A. Wassermann for their material and kind assistance in composing this tutorial 41/41
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
More informationTHE ORDER OF THE AUTOMORPHISM GROUP OF A BINARY q-analog OF THE FANO PLANE IS AT MOST TWO
THE ORDER OF THE AUTOMORPHISM GROUP OF A BINARY -ANALOG OF THE FANO PLANE IS AT MOST TWO MICHAEL KIERMAIER, SASCHA KURZ, AND ALFRED WASSERMANN Abstract. It is shown that the automorphism group of a binary
More informationarxiv: v2 [math.co] 2 May 2018
A SUBSPACE CODE OF SIZE 333 IN THE SETTING OF A BINARY q-analog OF THE FANO PLANE DANIEL HEINLEIN, MICHAEL KIERMAIER, SASCHA KURZ, AND ALFRED WASSERMANN arxiv:1708.06224v2 [math.co] 2 May 2018 Abstract.
More informationDesigns over the binary field from the complete monomial group
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 67(3) (2017), Pages 470 475 Designs over the binary field from the complete monomial group Michael Braun Faculty of Computer Science University of Applied Sciences
More informationNew arcs in projective Hjelmslev planes over Galois rings
New arcs in projective Hjelmslev planes over Galois rings Michael Kiermaier and Axel Kohnert ABSTRACT. It is known that some good linear codes over a finite ring (R-linear codes) arise from interesting
More informationThe Impact of Network Coding on Mathematics
The Impact of Network Coding on Mathematics Eimear Byrne University College Dublin DIMACS Workshop on Network Coding: the Next 15 Years Dec 15-17, 2015 Random Network Coding and Designs Over GF (q) COST
More informationCodes 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,
More informationCombinatorial Designs Man versus Machine
Combinatorial Designs Man versus Machine Anamari Nakić Department of Energy and Power Systems Faculty of Electrical Engineering and Computing University of Zagreb Zagreb 2015 1 / 47 The theory of combinatrial
More informationSome New Large Sets of Geometric Designs
Spyros S. Magliveras Department of Mathematical Sciences Florida Atlantic University Boca Raton, Florida, U.S.A. First annual Kliakhandler Conference Algebraic Combinatorics and Applications Houghton,
More informationConstructing 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.
More informationTABLES OF SUBSPACE CODES
TABLES OF SUBSPACE CODES DANIEL HEINLEIN, MICHAEL KIERMAIER, SASCHA KURZ, AND ALFRED WASSERMANN ABSTRACT. The main problem of subspace coding asks for the maximum possible cardinality of a subspace code
More informationThe Simple 7-(33,8,10)-Designs with Automorphism Group PΓL(2,32)
The Simple 7-(33,8,10)-Designs with Automorphism Group PΓL(2,32) Alfred Wassermann Abstract Lattice basis reduction in combination with an efficient backtracking algorithm is used to find all (4 996 426)
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 informationAsymptotic 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
More informationCONSTRUCTION OF (SOMETIMES) OPTIMAL LINEAR CODES
CONSTRUCTION OF (SOMETIMES) OPTIMAL LINEAR CODES MICHAEL BRAUN, AXEL KOHNERT AND ALFRED WASSERMANN 1. INTRODUCTION For the purpose of error correcting linear codes over a finite field GF (q) and fixed
More informationq-analogs of group divisible designs
-analogs of group divisible designs Marco Buratti, Michael Kiermaier, Sascha Kurz, Anamari Nakić, Alfred Wassermann September 7, 208 Abstract A well known class of objects in combinatorial design theory
More information1 Fields and vector spaces
1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary
More informationMathematical Department, University of Bayreuth, D Bayreuth
,, {6 () c Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. A Steiner 5-Design on 36 Points ANTON BETTEN anton.betten@uni-bayreuth.de REINHARD LAUE reinhard.laue@uni-bayreuth.de ALFRED
More informationConstructing t-designs with prescribed automorphism groups
Constructing t-designs with prescribed automorphism groups 2 Mario Osvin Pavčević University of Zagreb Croatia e-mail: mario.pavcevic@fer.hr /37 Dear organizers, thank you very much for the invitation!
More informationAbstract. the aid of a computer. The smallest parameter set found is 7-(24; 8; 4): for determining the isomorphism types. Further designs are derived
Some simple 7-designs A. Betten R. Laue A. Wassermann Abstract Some simple 7-designs with small parameters are constructed with the aid of a computer. The smallest parameter set found is 7-(24; 8; 4):
More informationDerived and Residual Subspace Designs
Derived and Residual Subspace Designs Michael Kiermaier, Reinhard Laue Universität Bayreuth, michael.kiermaier@uni-bayreuth.de, laue@uni-bayreuth.de Abstract A generalization of forming derived and residual
More informationk-subsets of V: Finding a collection which forms a t-design is equivalent to the problem of solving a system of diophantine equations, as mentioned ab
Simple 6- and 7-designs on 19 to 33 points Anton Betten 1, Reinhard Laue, Alfred Wassermann Universitat Bayreuth, Lehrstuhl II fur Mathematik, Lehrstuhl fur Mathematik und ihre Didaktik, D-95440 Bayreuth
More informationPOLYNOMIAL CODES AND FINITE GEOMETRIES
POLYNOMIAL CODES AND FINITE GEOMETRIES E. F. Assmus, Jr and J. D. Key Contents 1 Introduction 2 2 Projective and affine geometries 3 2.1 Projective geometry....................... 3 2.2 Affine geometry..........................
More informationTwisted Projective Spaces and Linear Completions of some Partial Steiner Triple Systems
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 49 (2008), No. 2, 341-368. Twisted Projective Spaces and Linear Completions of some Partial Steiner Triple Systems Ma lgorzata
More informationCodewords of small weight in the (dual) code of points and k-spaces of P G(n, q)
Codewords of small weight in the (dual) code of points and k-spaces of P G(n, q) M. Lavrauw L. Storme G. Van de Voorde October 4, 2007 Abstract In this paper, we study the p-ary linear code C k (n, q),
More informationIntroduction 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
More informationLax embeddings of the Hermitian Unital
Lax embeddings of the Hermitian Unital V. Pepe and H. Van Maldeghem Abstract In this paper, we prove that every lax generalized Veronesean embedding of the Hermitian unital U of PG(2, L), L a quadratic
More informationTight Sets and m-ovoids of Quadrics 1
Tight Sets and m-ovoids of Quadrics 1 Qing Xiang Department of Mathematical Sciences University of Delaware Newark, DE 19716 USA xiang@mathudeledu Joint work with Tao Feng and Koji Momihara 1 T Feng, K
More informationVertex opposition in spherical buildings
Vertex opposition in spherical buildings Anna Kasikova and Hendrik Van Maldeghem Abstract We study to which extent all pairs of opposite vertices of self-opposite type determine a given building. We provide
More informationPROJECTIVE 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
More informationParameterizing 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.
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More informationThe 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
More informationCharacterizations 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
More informationmake some group constructions. The resulting group is then prescribed as an automorphism group of the desired designs. Any such design is a collection
New t-designs and large sets of t-designs Anton Betten 1, Reinhard Laue, Alfred Wassermann Mathematical Department, University of Bayreuth, D-95440 Bayreuth, Germany Abstract Recent results in the search
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 informationCHAPTEER - TWO SUBGROUPS. ( Z, + ) is subgroup of ( R, + ). 1) Find all subgroups of the group ( Z 8, + 8 ).
CHAPTEER - TWO SUBGROUPS Definition 2-1. Let (G, ) be a group and H G be a nonempty subset of G. The pair ( H, ) is said to be a SUBGROUP of (G, ) if ( H, ) is group. Example. ( Z, + ) is subgroup of (
More informationPascal s Triangle, Normal Rational Curves, and their Invariant Subspaces
Europ J Combinatorics (2001) 22, 37 49 doi:101006/euc20000439 Available online at http://wwwidealibrarycom on Pascal s Triangle, Normal Rational Curves, and their Invariant Subspaces JOHANNES GMAINER Each
More informationTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON
More informationTHE NUMBER OF INVARIANT SUBSPACES UNDER A LINEAR OPERATOR ON FINITE VECTOR SPACES
Advances in Mathematics of Communications Volume 5, No. 2, 2011, 407 416 Web site: http://www.aimsciences.org THE NUMBER OF INVARIANT SUBSPACES UNDER A LINEAR OPERATOR ON FINITE VECTOR SPACES This work
More informationAn Introduction to (Network) Coding Theory
An Introduction to (Network) Coding Theory Anna-Lena Horlemann-Trautmann University of St. Gallen, Switzerland July 12th, 2018 1 Coding Theory Introduction Reed-Solomon codes 2 Introduction Coherent network
More informationA METHOD FOR CLASSIFICATION OF DOUBLY RESOLVABLE DESIGNS AND ITS APPLICATION. Stela Zhelezova
Serdica J. Computing 5 (2011), 273 308 A METHOD FOR CLASSIFICATION OF DOUBLY RESOLVABLE DESIGNS AND ITS APPLICATION Stela Zhelezova Abstract. The resolvability of combinatorial designs is intensively investigated
More informationBackground on Chevalley Groups Constructed from a Root System
Background on Chevalley Groups Constructed from a Root System Paul Tokorcheck Department of Mathematics University of California, Santa Cruz 10 October 2011 Abstract In 1955, Claude Chevalley described
More informationTheorems of Erdős-Ko-Rado type in polar spaces
Theorems of Erdős-Ko-Rado type in polar spaces Valentina Pepe, Leo Storme, Frédéric Vanhove Department of Mathematics, Ghent University, Krijgslaan 28-S22, 9000 Ghent, Belgium Abstract We consider Erdős-Ko-Rado
More informationEXERCISE SHEET 2 WITH SOLUTIONS
EXERCISE SHEET 2 WITH SOLUTIONS Some solutions are sketches only. If you want more details, ask me! (E35) Show that, for any prime power q, PG 2 (q) is an abstract projective plane. Answer. If < u > and
More informationLattice Theory Lecture 4. Non-distributive lattices
Lattice Theory Lecture 4 Non-distributive lattices John Harding New Mexico State University www.math.nmsu.edu/ JohnHarding.html jharding@nmsu.edu Toulouse, July 2017 Introduction Here we mostly consider
More informationDecomposing 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
More informationExercises for Unit I (Topics from linear algebra)
Exercises for Unit I (Topics from linear algebra) I.0 : Background Note. There is no corresponding section in the course notes, but as noted at the beginning of Unit I these are a few exercises which involve
More informationPascal s triangle, normal rational curves, and their invariant subspaces
Pascal s triangle, normal rational curves, and their invariant subspaces Johannes Gmainer August 20, 1999 Abstract Each normal rational curve Γ in PG(n, F ) admits a group PΓL(Γ) of automorphic collineations.
More informationIMA 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
More informationAdditional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs
Additional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs Colleen M. Swanson Computer Science & Engineering Division University of Michigan Ann Arbor, MI 48109,
More informationβ : V V k, (x, y) x yφ
CLASSICAL GROUPS 21 6. Forms and polar spaces In this section V is a vector space over a field k. 6.1. Sesquilinear forms. A sesquilinear form on V is a function β : V V k for which there exists σ Aut(k)
More informationExercises for Unit I (Topics from linear algebra)
Exercises for Unit I (Topics from linear algebra) I.0 : Background This does not correspond to a section in the course notes, but as noted at the beginning of Unit I it contains some exercises which involve
More informationSTEINER 2-DESIGNS S(2, 4, 28) WITH NONTRIVIAL AUTOMORPHISMS. Vedran Krčadinac Department of Mathematics, University of Zagreb, Croatia
GLASNIK MATEMATIČKI Vol. 37(57)(2002), 259 268 STEINER 2-DESIGNS S(2, 4, 28) WITH NONTRIVIAL AUTOMORPHISMS Vedran Krčadinac Department of Mathematics, University of Zagreb, Croatia Abstract. In this article
More informationThe definition of a vector space (V, +, )
The definition of a vector space (V, +, ) 1. For any u and v in V, u + v is also in V. 2. For any u and v in V, u + v = v + u. 3. For any u, v, w in V, u + ( v + w) = ( u + v) + w. 4. There is an element
More informationRoot systems. S. Viswanath
Root systems S. Viswanath 1. (05/07/011) 1.1. Root systems. Let V be a finite dimensional R-vector space. A reflection is a linear map s α,h on V satisfying s α,h (x) = x for all x H and s α,h (α) = α,
More informationSteiner triple and quadruple systems of low 2-rank
Steiner triple and quadruple systems of low 2-rank Vladimir D. Tonchev Department of Mathematical Sciences Michigan Technological University Houghton, MI 49931, USA tonchev@mtu.edu, www.math.mtu.edu/ tonchev
More informationL(C G (x) 0 ) c g (x). Proof. Recall C G (x) = {g G xgx 1 = g} and c g (x) = {X g Ad xx = X}. In general, it is obvious that
ALGEBRAIC GROUPS 61 5. Root systems and semisimple Lie algebras 5.1. Characteristic 0 theory. Assume in this subsection that chark = 0. Let me recall a couple of definitions made earlier: G is called reductive
More informationCounting matrices over finite fields
Counting matrices over finite fields Steven Sam Massachusetts Institute of Technology September 30, 2011 1/19 Invertible matrices F q is a finite field with q = p r elements. [n] = 1 qn 1 q = qn 1 +q n
More informationKevin James. MTHSC 412 Section 3.4 Cyclic Groups
MTHSC 412 Section 3.4 Cyclic Groups Definition If G is a cyclic group and G =< a > then a is a generator of G. Definition If G is a cyclic group and G =< a > then a is a generator of G. Example 1 Z is
More informationLarge sets of t designs from groups
Large sets of t designs from groups Spyros S. Magliveras Department of Mathematical Sciences Florida Atlantic University Boca Raton, Florida 33431-0991 Dedicated to Alex Rosa on the occasion of his 70th
More informationOptimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Subspace Distance 4
Optimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Subspace Distance 4 Thomas Honold, Michael Kiermaier, and Sascha Kurz In memoriam Axel Kohnert (1962{2013) Abstract. It is shown
More informationσ-hermitian Matrices Geometries on Joint work with Andrea Blunck (Hamburg, Germany) University of Warmia and Mazury Olsztyn, November 30th, 2010
Geometries on σ-hermitian Matrices Joint work with Andrea Blunck (Hamburg, Germany) University of Warmia and Mazury Olsztyn, November 30th, 2010 Scientific and Technological Cooperation Poland Austria
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationLecture 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
More informationAutomorphism Groups of Some Designs of Steiner Triple Systems and the Automorphism Groups of their Block Intersection Graphs.
Automorphism Groups of Some Designs of Steiner Triple Systems and the Automorphism Groups of their Block Intersection Graphs. by Sunday Vodah a thesis submitted in fulfillment of the requirements for the
More informationarxiv:math/ v1 [math.co] 21 Jun 2005
Counting polyominoes with minimum perimeter arxiv:math/0506428v1 [math.co] 21 Jun 2005 Abstract Sascha Kurz University of Bayreuth, Department of Mathematics, D-95440 Bayreuth, Germany The number of essentially
More informationarxiv: 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
More informationIntroduction to Block Designs
School of Electrical Engineering and Computer Science University of Ottawa lucia@eecs.uottawa.ca Winter 2017 What is Design Theory? Combinatorial design theory deals with the arrangement of elements into
More informationINVARIANT IDEALS OF ABELIAN GROUP ALGEBRAS UNDER THE MULTIPLICATIVE ACTION OF A FIELD, II
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 INVARIANT IDEALS OF ABELIAN GROUP ALGEBRAS UNDER THE MULTIPLICATIVE ACTION OF A FIELD, II J. M.
More informationq xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation.
Math 880 Alternative Challenge Problems Fall 2016 A1. Given, n 1, show that: m1 m 2 m = ( ) n+ 1 2 1, where the sum ranges over all positive integer solutions (m 1,..., m ) of m 1 + + m = n. Give both
More informationa (b + c) = a b + a c
Chapter 1 Vector spaces In the Linear Algebra I module, we encountered two kinds of vector space, namely real and complex. The real numbers and the complex numbers are both examples of an algebraic structure
More informationis an isomorphism, and V = U W. Proof. Let u 1,..., u m be a basis of U, and add linearly independent
Lecture 4. G-Modules PCMI Summer 2015 Undergraduate Lectures on Flag Varieties Lecture 4. The categories of G-modules, mostly for finite groups, and a recipe for finding every irreducible G-module of a
More informationOn some incidence structures constructed from groups and related codes
On some incidence structures constructed from groups and related codes Dean Crnković Department of Mathematics University of Rijeka Croatia Algebraic Combinatorics and Applications The first annual Kliakhandler
More informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
More informationBoolean Algebras, Boolean Rings and Stone s Representation Theorem
Boolean Algebras, Boolean Rings and Stone s Representation Theorem Hongtaek Jung December 27, 2017 Abstract This is a part of a supplementary note for a Logic and Set Theory course. The main goal is to
More informationProbabilistic construction of t-designs over finite fields
Probabilistic construction of t-designs over finite fields Shachar Lovett (UCSD) Based on joint works with Arman Fazeli (UCSD), Greg Kuperberg (UC Davis), Ron Peled (Tel Aviv) and Alex Vardy (UCSD) Gent
More information13. Forms and polar spaces
58 NICK GILL In this section V is a vector space over a field k. 13. Forms and polar spaces 13.1. Sesquilinear forms. A sesquilinear form on V is a function β : V V k for which there exists σ Aut(k) such
More informationMessage 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
More informationMath 210C. The representation ring
Math 210C. The representation ring 1. Introduction Let G be a nontrivial connected compact Lie group that is semisimple and simply connected (e.g., SU(n) for n 2, Sp(n) for n 1, or Spin(n) for n 3). Let
More informationFinite affine planes in projective spaces
Finite affine planes in projective spaces J. A.Thas H. Van Maldeghem Ghent University, Belgium {jat,hvm}@cage.ugent.be Abstract We classify all representations of an arbitrary affine plane A of order q
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationLax Embeddings of Generalized Quadrangles in Finite Projective Spaces
Lax Embeddings of Generalized Quadrangles in Finite Projective Spaces J. A. Thas H. Van Maldeghem 1 Introduction Definition 1.1 A (finite) generalized quadrangle (GQ) S = (P, B, I) is a point-line incidence
More informationPRIMES Math Problem Set
PRIMES Math Problem Set PRIMES 017 Due December 1, 01 Dear PRIMES applicant: This is the PRIMES 017 Math Problem Set. Please send us your solutions as part of your PRIMES application by December 1, 01.
More informationADVANCED TOPICS IN ALGEBRAIC GEOMETRY
ADVANCED TOPICS IN ALGEBRAIC GEOMETRY DAVID WHITE Outline of talk: My goal is to introduce a few more advanced topics in algebraic geometry but not to go into too much detail. This will be a survey of
More informationClassification of Directed and Hybrid Triple Systems
BAYREUTHER MATHEMATISCHE SCHRIFTEN 74 (2005), 276-291 Classification of Directed and Hybrid Triple Systems Patric R. J. Östergård and Olli Pottonen Abstract Pairwise nonisomorphic directed and hybrid triple
More informationA Course in Combinatorics
A Course in Combinatorics J. H. van Lint Technical Universüy of Eindhoven and R. M. Wilson California Institute of Technology H CAMBRIDGE UNIVERSITY PRESS CONTENTS Preface xi 1. Graphs 1 Terminology of
More informationAn algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 2 (207) 205 27 An algebraic proof of the Erdős-Ko-Rado theorem for intersecting
More information11 Block Designs. Linear Spaces. Designs. By convention, we shall
11 Block Designs Linear Spaces In this section we consider incidence structures I = (V, B, ). always let v = V and b = B. By convention, we shall Linear Space: We say that an incidence structure (V, B,
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More informationSynthetic Geometry. 1.4 Quotient Geometries
Synthetic Geometry 1.4 Quotient Geometries Quotient Geometries Def: Let Q be a point of P. The rank 2 geometry P/Q whose "points" are the lines of P through Q and whose "lines" are the hyperplanes of of
More informationGalois geometries contributing to coding theory
Ghent University Dept. of Mathematics Krijgslaan 281 - S22 9000 Ghent Belgium Opatija, 2010 OUTLINE 1 CODING THEORY 2 GRIESMER BOUND AND MINIHYPERS 3 COVERING RADIUS AND SATURATING SETS 4 LINEAR MDS CODES
More informationCombinatorics of p-ary Bent Functions
Combinatorics of p-ary Bent Functions MIDN 1/C Steven Walsh United States Naval Academy 25 April 2014 Objectives Introduction/Motivation Definitions Important Theorems Main Results: Connecting Bent Functions
More informationDISCRETE SUBGROUPS, LATTICES, AND UNITS.
DISCRETE SUBGROUPS, LATTICES, AND UNITS. IAN KIMING 1. Discrete subgroups of real vector spaces and lattices. Definitions: A lattice in a real vector space V of dimension d is a subgroup of form: Zv 1
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
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 informationSymmetric bowtie decompositions of the complete graph
Symmetric bowtie decompositions of the complete graph Simona Bonvicini Dipartimento di Scienze e Metodi dell Ingegneria Via Amendola, Pad. Morselli, 4100 Reggio Emilia, Italy simona.bonvicini@unimore.it
More informationREGULAR TRIPLETS IN COMPACT SYMMETRIC SPACES
REGULAR TRIPLETS IN COMPACT SYMMETRIC SPACES MAKIKO SUMI TANAKA 1. Introduction This article is based on the collaboration with Tadashi Nagano. In the first part of this article we briefly review basic
More informationCopositive matrices and periodic dynamical systems
Extreme copositive matrices and periodic dynamical systems Weierstrass Institute (WIAS), Berlin Optimization without borders Dedicated to Yuri Nesterovs 60th birthday February 11, 2016 and periodic dynamical
More informationFlag-Transitive Linear Spaces and Line Spreads of Projective Spaces. Michael Pauley
Flag-Transitive Linear Spaces and Line Spreads of Projective Spaces Michael Pauley April 28, 2006 Abstract A linear space is an incidence structure of points and lines having the property that there is
More information