Flag codes of maximum distance and constructions using Singer groups

DOI10.1016/J.FFA.2022.102011zbMATH Open1505.94124arXiv2109.00270OpenAlexW3197134839MaRDI QIDQ2123306FDOQ2123306

Authors: Miguel Ángel Navarro-Pérez, Xaro Soler-Escrivà 

Publication date: 8 April 2022

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

Abstract: In this paper we study flag codes of maximum distance. We characterize these codes in terms of, at most, two relevant constant dimension codes naturally associated to them. We do this first for general flag codes and then particularize to those arising as orbits under the action of arbitrary subgroups of the general linear group. We provide two different systematic orbital constructions of flag codes attaining both maximum distance and size. To this end, we use the action of Singer groups and take advantage of the good relation between these groups and Desarguesian spreads, as well as the fact that they act transitively on lines and hyperplanes.

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

Recommendations

• An orbital construction of optimum distance flag codes
• Cyclic orbit flag codes
• Flag codes: distance vectors and cardinality bounds
• Constructions of optimum distance full flag codes
• Optimum distance flag codes from spreads via perfect matchings in graphs
• Flag codes from planar spreads in network coding
• Abelian non-cyclic orbit codes and multishot subspace codes
• A construction of orbit codes
• A subspace code of size 333 in the setting of a binary \(q\)-analog of the Fano plane

zbMATH Keywords

orbit codessubspace codesnetwork codingDesarguesian spreadsflag codesSinger group actions

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60) Spreads and packing problems in finite geometry (51E23)

Cites Work

• Field reduction and linear sets in finite geometry
• Title not available (Why is that?)
• Title not available (Why is that?)
• Network information flow
• Title not available (Why is that?)
• Cyclic Orbit Codes
• Endliche Gruppen I
• Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
• Coding for Errors and Erasures in Random Network Coding
• Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
• Desarguesian spreads and field reduction for elements of the semilinear group
• On the orbits of Singer groups and their subgroups
• A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
• Cyclic orbit codes and stabilizer subfields
• Partial spreads in random network coding
• An algebraic approach for decoding spread codes
• Singer Groups
• Network coding with flags
• Flag codes from planar spreads in network coding
• Bounds for flag codes
• Optimum distance flag codes from spreads via perfect matchings in graphs
• Message encoding and retrieval for spread and cyclic orbit codes
• An orbital construction of optimum distance flag codes
• Cyclic orbit flag codes

Cited In (8)

• Constructions of optimum distance full flag codes
• Maximum flag-rank distance codes
• Cyclic orbit flag codes
• A subspace code of size 333 in the setting of a binary \(q\)-analog of the Fano plane
• Flag codes: distance vectors and cardinality bounds
• Bounds for flag codes
• An orbital construction of optimum distance flag codes
• Equivalence for flag codes

This page was built for publication: Flag codes of maximum distance and constructions using Singer groups

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