Flag codes of maximum distance and constructions using Singer groups
From MaRDI portal
Publication:2123306
Abstract: In this paper we study flag codes of maximum distance. We characterize these codes in terms of, at most, two relevant constant dimension codes naturally associated to them. We do this first for general flag codes and then particularize to those arising as orbits under the action of arbitrary subgroups of the general linear group. We provide two different systematic orbital constructions of flag codes attaining both maximum distance and size. To this end, we use the action of Singer groups and take advantage of the good relation between these groups and Desarguesian spreads, as well as the fact that they act transitively on lines and hyperplanes.
Recommendations
- An orbital construction of optimum distance flag codes
- Cyclic orbit flag codes
- Flag codes: distance vectors and cardinality bounds
- Constructions of optimum distance full flag codes
- Optimum distance flag codes from spreads via perfect matchings in graphs
- Flag codes from planar spreads in network coding
- Abelian non-cyclic orbit codes and multishot subspace codes
- A construction of orbit codes
- A subspace code of size 333 in the setting of a binary \(q\)-analog of the Fano plane
Cites work
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- An algebraic approach for decoding spread codes
- An orbital construction of optimum distance flag codes
- Bounds for flag codes
- Coding for Errors and Erasures in Random Network Coding
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Cyclic Orbit Codes
- Cyclic orbit codes and stabilizer subfields
- Cyclic orbit flag codes
- Desarguesian spreads and field reduction for elements of the semilinear group
- Endliche Gruppen I
- Field reduction and linear sets in finite geometry
- Flag codes from planar spreads in network coding
- scientific article; zbMATH DE number 607286 (Why is no real title available?)
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- scientific article; zbMATH DE number 1382769 (Why is no real title available?)
- Message encoding and retrieval for spread and cyclic orbit codes
- Network coding with flags
- Network information flow
- On the orbits of Singer groups and their subgroups
- Optimum distance flag codes from spreads via perfect matchings in graphs
- Partial spreads in random network coding
- Singer Groups
- Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
Cited in
(14)- The gallery distance of flags
- An orbital construction of optimum distance flag codes
- Flag codes: distance vectors and cardinality bounds
- Cyclic orbit flag codes
- Bounds for flag codes
- A subspace code of size 333 in the setting of a binary \(q\)-analog of the Fano plane
- Constructions of optimum distance full flag codes
- Equivalence for flag codes
- Maximum flag-rank distance codes
- Quasi-optimum distance flag codes
- Two methods of constructing optimum distance flag codes
- Spread codes from abelian non-cyclic groups
- Cardinality-consistent flag codes with larger cardinality
- Distance distribution of cyclic orbit flag codes
This page was built for publication: Flag codes of maximum distance and constructions using Singer groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2123306)