Bounds for flag codes
The Grassmann distance of two flags \((W_1,\ldots , W_m)\) and \((V_1,\ldots , V_m)\) of the same Type \(T=(\dim (W_i))_{i=1..m} = (\dim(V_i))_{i=1..m} \) is defined as \(\sum _{i=1}^m (\dim(W_i) - \dim(W_i \cap V_i) )\), i.e. the sum of the Grassmann distances of the subspaces in the flags. The paper derives upper and lower bounds on the number \(A_q^f(v,d,T)\) of flags in \({\mathbb F}_q^v\) of a given type \(T\) of minimum distance \(\geq d\). Most of the bounds are for full flags, where \(A_q^f(v,d) := A_q^f(v,d,(1,\ldots, v) )\). For certain parameters, the author obtains exact values: \begin{itemize} \item \(A_q^f(3,2) = q^2+q+1 \) \item \(A_q^f(4,3) = q^3+q^2+q+1 \) \item \(A_q^f(v,1) = \prod_{i=2}^v \frac{q^i-1}{q-1} \) \item \(A_q^f(2k,k^2) = q^k+1 \) \item \(A_q^f(2k+1,k^2+k) = q^{k+1}+1 \) \end{itemize} Note that these values are messed up in the statements of the propositions in the printed paper. The methods of proofs are versatile; the author uses graph theoretic methods to obtain good integer linear programming bounds as well as explicit computer constructions (partly with a prescribed symmetry group) to obtain good lower bounds.
- Flag codes: distance vectors and cardinality bounds
- Optimum distance flag codes from spreads via perfect matchings in graphs
- Constructions of optimum distance full flag codes
- Flag codes of maximum distance and constructions using Singer groups
- Linear programming bounds for codes in grassmannian spaces
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Flag codes from planar spreads in network coding
- Johnson type bounds on constant dimension codes
- Linear authentication codes: bounds and constructions
- Network coding with flags
- On a set of lines of \(PG(3,q)\) corresponding to a maximal cap contained in the Klein quadric of \(PG(5,q)\).
- On the Lengths of Divisible Codes
- On the orbits of Singer groups and their subgroups
- Partial spreads in finite projective spaces and partial designs
- Subspace packings: constructions and bounds
- Theory of codes with maximum rank distance
- The gallery distance of flags
- Network coding with flags
- An orbital construction of optimum distance flag codes
- Flag codes: distance vectors and cardinality bounds
- Flag codes of maximum distance and constructions using Singer groups
- New constructions of constant dimension codes by improved inserting construction
- Submodule codes as spherical codes in buildings
- Degenerate flag varieties in network coding
- Maximum flag-rank distance codes
- Quasi-optimum distance flag codes
- Full flag codes are the q-analog of permutation codes with the Manhattan metric
- Distance distribution of cyclic orbit flag codes
- A new invariant for cyclic orbit flag codes
- Construction of optimal flag codes by MRD codes
- Motzkin paths associated with flag codes
- Optimum distance flag codes from spreads via perfect matchings in graphs
- A bound on Grassmannian codes
This page was built for publication: Bounds for flag codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2243893)
