Optimum distance flag codes from spreads via perfect matchings in graphs
From MaRDI portal
Publication:825551
DOI10.1007/s10801-021-01086-yzbMath1495.94139arXiv2005.09370OpenAlexW3216953947MaRDI QIDQ825551
Clementa Alonso-González, Xaro Soler-Escrivà, Miguel Ángel Navarro-Pérez
Publication date: 17 December 2021
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.09370
Combinatorial aspects of finite geometries (05B25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial codes (94B25)
Related Items
Flag codes of maximum distance and constructions using Singer groups, Submodule codes as spherical codes in buildings, An orbital construction of optimum distance flag codes, Flag codes: distance vectors and cardinality bounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algebraic approach for decoding spread codes
- Equidistant subspace codes
- Matching theory
- Network coding with flags
- Flag codes from planar spreads in network coding
- Bounds for flag codes
- Equidistant codes in the Grassmannian
- Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
- Spread decoding in extension fields
- Partial spreads in random network coding
- Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs
- Field reduction and linear sets in finite geometry
- An Algorithm for Distinct Representatives
- Coding for Errors and Erasures in Random Network Coding
- Network information flow
- Paths, Trees, and Flowers
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
