at Google ScholarTitle data
Kurz, Sascha:
Subspaces intersecting in at most a point.
Bayreuth
,
2019
. - 4 p.
Official URL: 
Abstract in another language
We improve on the lower bound of the maximum number of planes in PG(8,q) pairwise intersecting in at most a point. In terms of constant dimension codes this leads to A<sub>q(9,4;3) ≥ q¹² + 2q⁸ + 2q⁷ + q⁶ + 2q⁵ + 2q⁴ - 2q² - 2q + 1. This result is obtained via a more general construction strategy, which also yields other improvements.
Further data
| Item Type: | Preprint, postprint |
|---|---|
| Keywords: | constant dimension codes; finite projective geometry; network coding |
| Subject classification: | Mathematics Subject Classification Code: 51E20 (05B25 94B65) |
| Institutions of the University: | 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 Faculties > Faculty of Mathematics, Physics und Computer Science |
| Result of work at the UBT: | Yes |
| DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics |
| Date Deposited: | 06 Jul 2019 21:00 |
| Last Modified: | 08 Jul 2019 05:30 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/49875 |