activity
20122021
most citedInfinitesimal Poincaré-Bendixson Problem in dimension three

2 citations · 2 across the 2 of their papers we have counts for

collaborators

6 papers

cs.IT2021

Cyclic Orbit Flag Codes

Clementa Alonso-González, Miguel Ángel Navarro-Pérez

In network coding, a flag code is a set of sequences of nested subspaces of , being the finite field with elements. Flag codes defined as orbits…

cs.IT2020

Consistent Flag Codes

Clementa Alonso-González, Miguel Ángel Navarro-Pérez

In this paper we study flag codes on , being the finite field with elements. Special attention is given to the connection between the parameters…

cs.IT2020

An Orbital Construction of Optimum Distance Flag Codes

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

Flag codes are multishot network codes consisting of sequences of nested subspaces (flags) of a vector space , where is a prime power and , the fi…

cs.IT2020

Optimum Distance Flag Codes from Spreads via Perfect Matchings in Graphs

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

In this paper, we study flag codes on the vector space , being a prime power and the finite field of elements. More precisely, we focus on fl…

cs.IT2020

Flag Codes from Planar Spreads in Network Coding

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

In this paper we study a class of multishot network codes given by families of nested subspaces (flags) of a vector space , being a prime power and $\mathbb{F}_…

math.DS20122 cited

Infinitesimal Poincaré-Bendixson Problem in dimension three

C. Alonso-González, F. Cano, R. Rosas

We describe the sets of accumulation of secants for orbits of real analytic vector fields in dimension three having the origin as only ω-limit point. It is a kind of infinitesimal…