Partial ‐Parallelisms in Finite Projective Spaces
From MaRDI portal
Publication:5249055
DOI10.1002/jcd.21392zbMath1319.51007arXiv1302.3629OpenAlexW1873230754MaRDI QIDQ5249055
Publication date: 29 April 2015
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.3629
Combinatorial aspects of finite geometries (05B25) Spreads and packing problems in finite geometry (51E23) Combinatorial structures in finite projective spaces (51E20) Finite partial geometries (general), nets, partial spreads (51E14) Linear incidence geometric structures with parallelism (51A15) Combinatorial aspects of packing and covering (05B40)
Related Items (6)
New lower bounds for partial k‐parallelisms ⋮ Subspace packings: constructions and bounds ⋮ Galois geometries and coding theory ⋮ Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13 ⋮ Generalized vector space partitions ⋮ On resolving sets in the point-line incidence graph of PG(n, q)
Cites Work
- Unnamed Item
- Theory of codes with maximum rank distance
- Linear groups containing a Singer cycle
- A characteristic property of geometric \(t\)-spreads in finite projective spaces
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- Bilinear forms over a finite field, with applications to coding theory
- Normal spreads
- On parallelisms in finite projective spaces
- On point-cyclic resolutions of the 2-(63, 7, 15) design associated with PG(5, 2)
- Partial parallelisms in finite projective spaces
- Codes and Designs Related to Lifted MRD Codes
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- On the Preparata and Goethals codes
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: Partial ‐Parallelisms in Finite Projective Spaces
