Flag codes from planar spreads in network coding

DOI10.1016/J.FFA.2020.101745zbMATH Open1464.94081arXiv2004.14867OpenAlexW3091366941MaRDI QIDQ1994965FDOQ1994965

Authors: 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)

Abstract: In this paper we study a class of multishot network codes given by families of nested subspaces (flags) of a vector space $mathbb{F}_q^n$, being $q$ a prime power and $mathbb{F}_q$ the finite field of $q$ elements. In particular, we focus on flag codes having maximum minimum distance (optimum distance flag codes). We explore the existence of these codes from spreads, based on the good properties of the latter ones. For $n=2k$, we show that optimum distance full flag codes with the largest size are exactly those that can be constructed from a planar spread. We give a precise construction of them as well as a decoding algorithm.

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

Recommendations

• Degenerate flag varieties in network coding
• Network coding with flags
• On network codes and partial spreads
• Flag codes: distance vectors and cardinality bounds
• Optimum distance flag codes from spreads via perfect matchings in graphs
• Partial spreads in random network coding
• Constructions of optimum distance full flag codes
• Network coding and subspace designs
• Codes from flag varieties over a finite field
• A new construction of spread codes

zbMATH Keywords

projective spacesubspace codesnetwork codingspreadsflag codes

Mathematics Subject Classification ID

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

Cites Work

• Field reduction and linear sets in finite geometry
• Network information flow
• Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
• Coding for Errors and Erasures in Random Network Coding
• Partial spreads in random network coding
• Equidistant codes in the Grassmannian
• Scattered spaces with respect to spreads, and eggs in finite projective spaces
• Network coding with flags
• Spread decoding in extension fields
• Equidistant subspace codes

Cited In (15)

• Optimum distance flag codes from spreads via perfect matchings in graphs
• Partial spreads in random network coding
• Constructions of optimum distance full flag codes
• Maximum flag-rank distance codes
• Network coding with flags
• Cyclic orbit flag codes
• Flag codes: distance vectors and cardinality bounds
• Bounds for flag codes
• Spread decoding in extension fields
• An orbital construction of optimum distance flag codes
• An algebraic approach for decoding spread codes
• Submodule codes as spherical codes in buildings
• Degenerate flag varieties in network coding
• On network codes and partial spreads
• Flag codes of maximum distance and constructions using Singer groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994965)