Linear codes meeting the Griesmer bound, minihypers and geometric applications
AbstractCoding theory and Galois geometries are two research areas which greatly influence each other. In this talk, we focus on the link between linear codes meeting the Griesmer bound and minihypers in finite projective spaces. Minihypers are particular (multiple) blocking sets. We present characterization results on minihypers, leading to equivalent characterization results on linear codes meeting the Griesmer bound. Next to being interesting from a coding-theoretical point of view, minihypers also are interesting for geometrical applications. We present results on maximal partial μ-spreads in PG(N, q), (μ + 1)|(N + 1), on minimal μ-covers in PG(N, q), (μ + 1)|(N + 1), on (N − 1)-covers of Q + (2N + 1, q), on partial ovoids and on partial spreads of finite classical polar spaces, and on partial ovoids of generalized hexagons, following from results on minihypers.
The authors retain all rights to the original work without any restrictions.
License for Published Contents
"Le Matematiche" published articlesa are distribuited with Creative Commons Attribution 4.0 International. You are free to copy, distribute and transmit the work, and to adapt the work. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
License for Metadata
"Le Matematiche" published articles metadata are dedicated to the public domain by waiving all publisher's rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.
You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
No Fee Charging
No fee is required to complete the submission/review/publishing process of authors paper.