## Title data

Kurz, Sascha:

**Improved upper bounds for partial spreads.**

*In:* Designs, Codes and Cryptography.
Vol. 85
(2017)
Issue 1
.
- pp. 97-106.

ISSN 1573-7586

DOI: https://doi.org/10.1007/s10623-016-0290-8

## Related URLs

## Project information

Project title: |
Project's official title Project's id Ganzzahlige Optimierungsmodelle für Subspace Codes und endliche Geometrie No information |
---|---|

Project financing: |
Deutsche Forschungsgemeinschaft |

## Abstract in another language

A partial (k-1)-spread} in PG(n-1,q) is a collection of (k-1)-dimensional subspaces with trivial intersection such that each point is covered at most once. So far the maximum size of a partial (k-1)-spread in PG(n-1,q) was know for the cases where n is congruent to 0 or 1 modulo k, and for the special case where n is congruent to 2 modulo k, but we additionally have q=2 and k=3. We completely resolve the case where n is congruent to 2 modulo k and q=2, i.e., the binary case.

## Further data

Item Type: | Article in a journal |
---|---|

Refereed: | Yes |

Keywords: | Galois geometry; partial spreads; constant dimension codes; vector space partitions; orthogonal arrays; (s,r,mu)-nets |

Subject classification: | MSC: 51E23 (05B15 05B40 11T71 94B25) |

Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics Faculties |

Result of work at the UBT: | Yes |

DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics |

Date Deposited: | 10 Aug 2017 10:41 |

Last Modified: | 23 Nov 2022 07:54 |

URI: | https://eref.uni-bayreuth.de/id/eprint/39085 |