Flag codes: distance vectors and cardinality bounds
From MaRDI portal
Publication:2093501
DOI10.1016/j.laa.2022.09.016OpenAlexW3212703614MaRDI QIDQ2093501
Miguel Ángel Navarro-Pérez, Clementa Alonso-González, Xaro Soler-Escrivà
Publication date: 8 November 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.00910
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)
Cites Work
- An algebraic approach for decoding spread codes
- Optimum distance flag codes from spreads via perfect matchings in graphs
- Johnson type bounds on constant dimension codes
- Network coding and subspace designs
- Network coding with flags
- Message encoding and retrieval for spread and cyclic orbit codes
- Flag codes from planar spreads in network coding
- An orbital construction of optimum distance flag codes
- Flag codes of maximum distance and constructions using Singer groups
- Bounds for flag codes
- Improved upper bounds for partial spreads
- Partial spreads in random network coding
- Coding for Errors and Erasures in Random Network Coding
- Network information flow
- Error-Correcting Codes in Projective Space
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
This page was built for publication: Flag codes: distance vectors and cardinality bounds
