Flag codes from planar spreads in network coding

DOI10.1016/j.ffa.2020.101745zbMath1464.94081arXiv2004.14867OpenAlexW3091366941MaRDI QIDQ1994965

Clementa Alonso-González, Miguel Ángel Navarro-Pérez, Xaro Soler-Escrivà

Publication date: 18 February 2021

Published in: Finite Fields and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

spreadsprojective spacesubspace codesnetwork codingflag codes

Mathematics Subject Classification ID

Other types of codes (94B60) Decoding (94B35) Finite geometry and special incidence structures (51E99)

Related Items (8)

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 ⋮ Constructions of optimum distance full flag codes ⋮ Cyclic orbit flag codes ⋮ Bounds for flag codes ⋮ An orbital construction of optimum distance flag codes ⋮ Flag codes: distance vectors and cardinality bounds

Cites Work

• Unnamed Item
• Equidistant subspace codes
• Network coding with flags
• 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
• Field reduction and linear sets in finite geometry
• Coding for Errors and Erasures in Random Network Coding
• Network information flow

This page was built for publication: Flag codes from planar spreads in network coding