Back to Search
Start Over
Optimum distance flag codes from spreads via perfect matchings in graphs
- Source :
- RUA. Repositorio Institucional de la Universidad de Alicante, Universidad de Alicante (UA)
- Publication Year :
- 2021
- Publisher :
- Springer Nature, 2021.
-
Abstract
- In this paper, we study flag codes on the vector space $${{\mathbb {F}}}_q^n$$ F q n , being q a prime power and $${{\mathbb {F}}}_q$$ F q the finite field of q elements. More precisely, we focus on flag codes that attain the maximum possible distance (optimum distance flag codes) and can be obtained from a spread of $${{\mathbb {F}}}_q^n$$ F q n . We characterize the set of admissible type vectors for this family of flag codes and also provide a construction of them based on well-known results about perfect matchings in graphs. This construction attains both the maximum distance for its type vector and the largest possible cardinality for that distance.
- Subjects :
- FOS: Computer and information sciences
Matemáticas
Computer Science - Information Theory
Type (model theory)
Combinatorics
Set (abstract data type)
Cardinality
Network coding
Álgebra
FOS: Mathematics
Discrete Mathematics and Combinatorics
Mathematics - Combinatorics
Perfect matching
Spreads
Prime power
Mathematics
Subspace codes
Algebra and Number Theory
Information Theory (cs.IT)
Finite field
Geometría y Topología
Combinatorics (math.CO)
Focus (optics)
Graphs
Flag codes
Vector space
Flag (geometry)
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- RUA. Repositorio Institucional de la Universidad de Alicante, Universidad de Alicante (UA)
- Accession number :
- edsair.doi.dedup.....cb2f12f34f6f8fd92cf4f33d31b1c2b9