Bounds for flag codes

DOI10.1007/S10623-021-00953-WMaRDI QIDQ2243893zbMATH OpenOpenAlexFDO

Authors 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

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

Abstract: The application of flags to network coding has been introduced recently by Liebhold, Nebe, and Vazquez-Castro. It is a variant to random linear network coding and explicit routing solutions for given networks. Here we study lower and upper bounds for the maximum possible cardinality of a corresponding flag code with given parameters.

Recommendations

• 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

Cites work

• 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

Cited in

(10)

• Flag codes of maximum distance and constructions using Singer groups
• Optimum distance flag codes from spreads via perfect matchings in graphs
• An orbital construction of optimum distance flag codes
• A bound on Grassmannian codes
• 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
• Network coding with flags
• Flag codes: distance vectors and cardinality bounds

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)