Partial spreads and vector space partitions
From MaRDI portal
Publication:6279902
DOI10.1007/978-3-319-70293-3_7arXiv1611.06328MaRDI QIDQ6279902FDOQ6279902
Authors: Thomas Honold, Michael Kiermaier, Sascha Kurz 
Publication date: 19 November 2016
Abstract: Constant-dimension codes with the maximum possible minimum distance have been studied under the name of partial spreads in Finite Geometry for several decades. Not surprisingly, for this subclass typically the sharpest bounds on the maximal code size are known. The seminal works of Beutelspacher and Drake & Freeman on partial spreads date back to 1975, and 1979, respectively. From then until recently, there was almost no progress besides some computer-based constructions and classifications. It turns out that vector space partitions provide the appropriate theoretical framework and can be used to improve the long-standing bounds in quite a few cases. Here, we provide a historic account on partial spreads and an interpretation of the classical results from a modern perspective. To this end, we introduce all required methods from the theory of vector space partitions and Finite Geometry in a tutorial style. We guide the reader to the current frontiers of research in that field, including a detailed description of the recent improvements.
Orthogonal arrays, Latin squares, Room squares (05B15) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40) Spreads and packing problems in finite geometry (51E23)
This page was built for publication: Partial spreads and vector space partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6279902)
