Bounds for flag codes

DOI10.1007/s10623-021-00953-wzbMath1494.94056arXiv2005.04768OpenAlexW3207061113MaRDI QIDQ2243893

Sascha Kurz

Publication date: 11 November 2021

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.04768

zbMATH Keywords

boundserror correcting codesnetwork codingflag codesGrassmann distance on flagsinteger linear programming bounds

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Bounds on codes (94B65) Combinatorial aspects of finite geometries (05B25)

Related Items (6)

Flag codes of maximum distance and constructions using Singer groups ⋮ Optimum distance flag codes from spreads via perfect matchings in graphs ⋮ Submodule codes as spherical codes in buildings ⋮ New constructions of constant dimension codes by improved inserting construction ⋮ An orbital construction of optimum distance flag codes ⋮ Flag codes: distance vectors and cardinality bounds

Cites Work

• Johnson type bounds on constant dimension codes
• Theory of codes with maximum rank distance
• On a set of lines of \(PG(3,q)\) corresponding to a maximal cap contained in the Klein quadric of \(PG(5,q)\).
• Partial spreads in finite projective spaces and partial designs
• Network coding with flags
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Flag codes from planar spreads in network coding
• Subspace packings: constructions and bounds
• Linear authentication codes: bounds and constructions
• On the Lengths of Divisible Codes
• Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
• On the orbits of Singer groups and their subgroups

This page was built for publication: Bounds for flag codes