New lower bounds for partial k‐parallelisms
From MaRDI portal
Publication:6185550
DOI10.1002/jcd.21681arXiv1910.09178OpenAlexW2986541068WikidataQ126860031 ScholiaQ126860031MaRDI QIDQ6185550
No author found.
Publication date: 29 January 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.09178
Cites Work
- Unnamed Item
- Nontrivial \(t\)-designs over finite fields exist for all \(t\)
- Large sets of subspace designs
- Galois geometries and coding theory
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- On parallelisms in finite projective spaces
- On point-cyclic resolutions of the 2-(63, 7, 15) design associated with PG(5, 2)
- Bounds for projective codes from semidefinite programming
- Large constant dimension codes and lexicodes
- The maximum size of a partial spread in a finite projective space
- Partial parallelisms in finite projective spaces
- Über nicht-Desarguessche Ebenen mit transitiver Translationsgruppe
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- 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
- On Metrics for Error Correction in Network Coding
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Recursive Code Construction for Random Networks
- Partial ‐Parallelisms in Finite Projective Spaces
- Error-Correcting Codes in Projective Space
- Enumerative Coding for Grassmannian Space
This page was built for publication: New lower bounds for partial k‐parallelisms
