Miguel V. Carriegos
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Miguel V. Carriegos has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Noemí DeCastro-García
Universidad de León
11 shared publications - Ángel Luis Muñoz Castañeda
Departamento de Matemáticas, Universidad de León, León, Spain
7 shared publications - M. Teresa Trobajo
Departamento de Matemáticas, Universidad de León, 24071-León, Spain
5 shared publications - David Escudero García
Universidad de León
3 shared publications - Maria Isabel Garcia-Planas
Universitat Politecnica de Catalunya
3 shared publications - Diego Asterio De Zaballa
Instituto de Ciencias Aplicadas a Ciberseguridad, Universidad de León, León, Spain
2 shared publications
Latest Publications
- 31 May 2026
- Published by Springer Nature
- p. 55-71
Output Feedback Transformations for Preserving Observability and Structural Decodability in Convolutional Codes
- 31 May 2026
- Published by Springer Nature
- p. 55-71
Output Feedback Transformations for Preserving Observability and Structural Decodability in Convolutional Codes
- Open Access
- 1 January 2026
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 36 (1) , 141-154
Construction of observable and MDP convolutional codes with good decodable properties by ISO representations
This paper addresses the construction of observable and maximum distance profile convolutional codes over finite fields that exhibit good performance with some available decoding algorithms for convolutional codes. Our construction is based on the use of input/state/output representations and the invariance of certain properties of linear systems under various group actions. This framework allows us to systematically generate new convolutional codes from existing ones while preserving key decoding and distance properties.
- 1 January 2026
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 36 (1) , 141-154
Open AccessConstruction of observable and MDP convolutional codes with good decodable properties by ISO representations
This paper addresses the construction of observable and maximum distance profile convolutional codes over finite fields that exhibit good performance with some available decoding algorithms for convolutional codes. Our construction is based on the use of input/state/output representations and the invariance of certain properties of linear systems under various group actions. This framework allows us to systematically generate new convolutional codes from existing ones while preserving key decoding and distance properties.
- Open Access
- 20 May 2023
- Published by Hindawi Limited in Journal of Mathematics
- Vol. 2023, 1-6
Natural Factorization of Linear Control Systems through Parallel Gathering of Simple Systems
Linear systems over vector spaces and feedback morphisms form an additive category taking into account the parallel gathering of linear systems. This additive category has a minimal exact structure and thus a notion of simple systems as those systems have no subsystems apart from zero and themselves. The so-called single-input systems are proven to be exactly the simple systems in the category of reachable systems over vector spaces. The category is also proven to be semisimple in objects because every reachable linear system is decomposed in a finite parallel gathering of simple systems. Hence, decomposition result is fulfilled for linear systems and feedback morphisms, but category of reachable linear systems is not abelian semisimple because it is not balanced and hence fails to be abelian. Finally, it is conjectured that the category of linear systems and feedback actions is in fact semiabelian; some threads to find the result and consequences are also given.
- 20 May 2023
- Published by Hindawi Limited in Journal of Mathematics
- Vol. 2023, 1-6
Open AccessNatural Factorization of Linear Control Systems through Parallel Gathering of Simple Systems
Linear systems over vector spaces and feedback morphisms form an additive category taking into account the parallel gathering of linear systems. This additive category has a minimal exact structure and thus a notion of simple systems as those systems have no subsystems apart from zero and themselves. The so-called single-input systems are proven to be exactly the simple systems in the category of reachable systems over vector spaces. The category is also proven to be semisimple in objects because every reachable linear system is decomposed in a finite parallel gathering of simple systems. Hence, decomposition result is fulfilled for linear systems and feedback morphisms, but category of reachable linear systems is not abelian semisimple because it is not balanced and hence fails to be abelian. Finally, it is conjectured that the category of linear systems and feedback actions is in fact semiabelian; some threads to find the result and consequences are also given.
- Open Access
- 20 May 2023
- Published by Wiley in Computational and Mathematical Methods
- Vol. 2023, 1-8
Towards Supercomputing Categorizing the Maliciousness upon Cybersecurity Blacklists with Concept Drift
In this article, we have carried out a case study to optimize the classification of the maliciousness of cybersecurity events by IP addresses using machine learning techniques. The optimization is studied focusing on time complexity. Firstly, we have used the extreme gradient boosting model, and secondly, we have parallelized the machine learning algorithm to study the effect of using a different number of cores for the problem. We have classified the cybersecurity events’ maliciousness in a biclass and a multiclass scenario. All the experiments have been carried out with a well-known optimal set of features: the geolocation information of the IP address. However, the geolocation features of an IP address can change over time. Also, the relation between the IP address and its label of maliciousness can be modified if we test the address several times. Then, the models’ performance could degrade because the information acquired from training on past samples may not generalize well to new samples. This situation is known as concept drift. For this reason, it is necessary to study if the optimization proposed works in a concept drift scenario. The results show that the concept drift does not degrade the models. Also, boosting algorithms achieving competitive or better performance compared to similar research works for the biclass scenario and an effective categorization for the multiclass case. The best efficient setting is reached using five nodes regarding high-performance computation resources.
- 20 May 2023
- Published by Wiley in Computational and Mathematical Methods
- Vol. 2023, 1-8
Open AccessTowards Supercomputing Categorizing the Maliciousness upon Cybersecurity Blacklists with Concept Drift
In this article, we have carried out a case study to optimize the classification of the maliciousness of cybersecurity events by IP addresses using machine learning techniques. The optimization is studied focusing on time complexity. Firstly, we have used the extreme gradient boosting model, and secondly, we have parallelized the machine learning algorithm to study the effect of using a different number of cores for the problem. We have classified the cybersecurity events’ maliciousness in a biclass and a multiclass scenario. All the experiments have been carried out with a well-known optimal set of features: the geolocation information of the IP address. However, the geolocation features of an IP address can change over time. Also, the relation between the IP address and its label of maliciousness can be modified if we test the address several times. Then, the models’ performance could degrade because the information acquired from training on past samples may not generalize well to new samples. This situation is known as concept drift. For this reason, it is necessary to study if the optimization proposed works in a concept drift scenario. The results show that the concept drift does not degrade the models. Also, boosting algorithms achieving competitive or better performance compared to similar research works for the biclass scenario and an effective categorization for the multiclass case. The best efficient setting is reached using five nodes regarding high-performance computation resources.
- 31 December 2022
- Published by Springer Nature in Wireless Networks
- Vol. 30 (6) , 5033-5048
A mathematical analysis about the geo-temporal characterization of the multi-class maliciousness of an IP address
- 31 December 2022
- Published by Springer Nature in Wireless Networks
- Vol. 30 (6) , 5033-5048
A mathematical analysis about the geo-temporal characterization of the multi-class maliciousness of an IP address
- Open Access
- 16 June 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (12) , 2088
Some Categorical Properties of Linear Systems
Linear control systems are studied by means of a state-space approach. Feedback morphisms are presented as natural generalization of feedback equivalences. The set of feedback morphisms between two linear systems is a vector space. Kernels, cokernels, as well as monomorphisms, epimorphisms, sections, and retracts of feedback morphisms are studied in the category of linear systems over finite dimensional vector spaces. Finally, a classical Kalman’s decomposition of linear systems over vector spaces is presented as a split short exact sequence in the category.
- 16 June 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (12) , 2088
Open AccessSome Categorical Properties of Linear Systems
Linear control systems are studied by means of a state-space approach. Feedback morphisms are presented as natural generalization of feedback equivalences. The set of feedback morphisms between two linear systems is a vector space. Kernels, cokernels, as well as monomorphisms, epimorphisms, sections, and retracts of feedback morphisms are studied in the category of linear systems over finite dimensional vector spaces. Finally, a classical Kalman’s decomposition of linear systems over vector spaces is presented as a split short exact sequence in the category.
- Open Access
- 9 April 2022
- Published by Hindawi Limited in Computational and Mathematical Methods
- Vol. 2022, 1-9
Spanish Airport Network Structure: Topological Characterization
Applied complex network theory has become an interesting research field in the last years. Many papers have appeared on this subject dealing with the topological description of real transport systems, from small networks like the Italian airport network to the worldwide air transportation network. A comprehensive topological description of those critical structures is relevant in order to understand their dynamics, capacities, and vulnerabilities. In this work, for the first time, we describe the Spanish airport network (SAN) as a complex network. Nodes are airports, and links are flight connections weighed by traffic flow. We study its topological features and traffic dynamics. Our analysis shows that SAN has complex dynamics similar to small-size air transportation networks of other developed economies. It shares properties of small-world and scale-free networks, and it is highly connected and efficient and has a disassortative pattern for high-degree nodes.
- 9 April 2022
- Published by Hindawi Limited in Computational and Mathematical Methods
- Vol. 2022, 1-9
Open AccessSpanish Airport Network Structure: Topological Characterization
Applied complex network theory has become an interesting research field in the last years. Many papers have appeared on this subject dealing with the topological description of real transport systems, from small networks like the Italian airport network to the worldwide air transportation network. A comprehensive topological description of those critical structures is relevant in order to understand their dynamics, capacities, and vulnerabilities. In this work, for the first time, we describe the Spanish airport network (SAN) as a complex network. Nodes are airports, and links are flight connections weighed by traffic flow. We study its topological features and traffic dynamics. Our analysis shows that SAN has complex dynamics similar to small-size air transportation networks of other developed economies. It shares properties of small-world and scale-free networks, and it is highly connected and efficient and has a disassortative pattern for high-degree nodes.
- Open Access
- 18 March 2022
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 46 (15) , 15996-16005
Kalman reduced form and pole placement by state feedback for multi‐input linear systems over Hermite rings
A Kalman reduced form is obtained for linear systems over Hermite rings. This reduced form gives information of the set of assignable polynomials to a given linear system.
- 18 March 2022
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 46 (15) , 15996-16005
Open AccessKalman reduced form and pole placement by state feedback for multi‐input linear systems over Hermite rings
A Kalman reduced form is obtained for linear systems over Hermite rings. This reduced form gives information of the set of assignable polynomials to a given linear system.
- Open Access
- 20 November 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (22) , 2962
On the State Approach Representations of Convolutional Codes over Rings of Modular Integers
In this study, we prove the existence of minimal first-order representations for convolutional codes with the predictable degree property over principal ideal artinian rings. Further, we prove that any such first-order representation leads to an input/state/output representation of the code provided the base ring is local. When the base ring is a finite field, we recover the classical construction, studied in depth by J. Rosenthal and E. V. York. This allows us to construct observable convolutional codes over such rings in the same way as is carried out in classical convolutional coding theory. Furthermore, we prove the minimality of the obtained representations. This completes the study of the existence of input/state/output representations of convolutional codes over rings of modular integers.
- 20 November 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (22) , 2962
Open AccessOn the State Approach Representations of Convolutional Codes over Rings of Modular Integers
In this study, we prove the existence of minimal first-order representations for convolutional codes with the predictable degree property over principal ideal artinian rings. Further, we prove that any such first-order representation leads to an input/state/output representation of the code provided the base ring is local. When the base ring is a finite field, we recover the classical construction, studied in depth by J. Rosenthal and E. V. York. This allows us to construct observable convolutional codes over such rings in the same way as is carried out in classical convolutional coding theory. Furthermore, we prove the minimality of the obtained representations. This completes the study of the existence of input/state/output representations of convolutional codes over rings of modular integers.
- Open Access
- 16 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 102636-102648
On Aggregation and Prediction of Cybersecurity Incident Reports
The study of cybersecurity incidents is an active research field. The purpose of this work is to determine accurate measures of cybersecurity incidents. An effective method to aggregate cybersecurity incident reports is defined to set these measures. As a result we are able to make predictions and, therefore, to deploy security policies. Forecasting time-series of those cybersecurity aggregates is performed based on Koopman's method and Dynamic Mode Decomposition algorithm. Both techniques have shown to be accurate for a wide variety of dynamical systems ranging from fluid dynamics to social sciences. We have performed some experiments on public databases. We show that the measure of the risk trend can be effectively forecasted.
- 16 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 102636-102648
Open AccessOn Aggregation and Prediction of Cybersecurity Incident Reports
The study of cybersecurity incidents is an active research field. The purpose of this work is to determine accurate measures of cybersecurity incidents. An effective method to aggregate cybersecurity incident reports is defined to set these measures. As a result we are able to make predictions and, therefore, to deploy security policies. Forecasting time-series of those cybersecurity aggregates is performed based on Koopman's method and Dynamic Mode Decomposition algorithm. Both techniques have shown to be accurate for a wide variety of dynamical systems ranging from fluid dynamics to social sciences. We have performed some experiments on public databases. We show that the measure of the risk trend can be effectively forecasted.