José Andrés Armario
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
José Andrés Armario has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Victor Alvarez
Department of Applied Mathematics I, University of Seville, 41004 Sevilla, Spain
14 shared publications - María Dolores Frau
Department of Applied Mathematics I, University of Seville, 41004 Sevilla, Spain
13 shared publications - Ronan Egan
School of Mathematical Sciences, Dublin City University, Dublin, Ireland
10 shared publications - Dane L. Flannery
School of Mathematics, Statistics and Applied Mathematics, National University of Ireland Galway, Galway, Ireland
9 shared publications - Félix Gudiel
Department of Applied Mathematics I, University of Seville, 41004 Sevilla, Spain
8 shared publications - Amparo Osuna
Universidad de Sevilla
6 shared publications
Latest Publications
- 27 August 2026
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (6) , 2429-2442
A generalisation of bent vectors for Butson Hadamard matrices
- 27 August 2026
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (6) , 2429-2442
A generalisation of bent vectors for Butson Hadamard matrices
- 27 October 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 62 (3) , 1-26
Hadamard bent sequences and spherical designs
- 27 October 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 62 (3) , 1-26
Hadamard bent sequences and spherical designs
- Open Access
Butson Hadamard matrices, bent sequences, and spherical codes
We explore a notion of bent sequence attached to the data consisting of an Hadamard matrix of order $n$ defined over the complex $q^{th}$ roots of unity, an eigenvalue of that matrix, and a Galois automorphism from the cyclotomic field of order $q.$ In particular we construct self-dual bent sequences for various $q\le 60$ and lengths $n\le 21.$ Computational construction methods comprise the resolution of polynomial systems by Groebner bases and eigenspace computations. Infinite families can be constructed from regular Hadamard matrices, Bush-type Hadamard matrices, and generalized Boolean bent functions.As an application, we estimate the covering radius of the code attached to that matrix over $\Z_q.$ We derive a lower bound on that quantity for the Chinese Euclidean metric when bent sequences exist. We give the Euclidean distance spectrum, and bound above the covering radius of an attached spherical code, depending on its strength as a spherical design.Open AccessButson Hadamard matrices, bent sequences, and spherical codes
We explore a notion of bent sequence attached to the data consisting of an Hadamard matrix of order $n$ defined over the complex $q^{th}$ roots of unity, an eigenvalue of that matrix, and a Galois automorphism from the cyclotomic field of order $q.$ In particular we construct self-dual bent sequences for various $q\le 60$ and lengths $n\le 21.$ Computational construction methods comprise the resolution of polynomial systems by Groebner bases and eigenspace computations. Infinite families can be constructed from regular Hadamard matrices, Bush-type Hadamard matrices, and generalized Boolean bent functions.As an application, we estimate the covering radius of the code attached to that matrix over $\Z_q.$ We derive a lower bound on that quantity for the Chinese Euclidean metric when bent sequences exist. We give the Euclidean distance spectrum, and bound above the covering radius of an attached spherical code, depending on its strength as a spherical design. - Open Access
- 23 August 2023
- Published by Springer Nature in Cryptography and Communications
- Vol. 16 (2) , 323-337
Generalized partially bent functions, generalized perfect arrays, and cocyclic Butson matrices
In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering Butson matrices that are cocyclic rather than strictly group invariant. This result has several applications; for example, to the construction of Boolean functions whose expansions are generalized partially bent functions, including cases where no bent function can exist.
- 23 August 2023
- Published by Springer Nature in Cryptography and Communications
- Vol. 16 (2) , 323-337
Open AccessGeneralized partially bent functions, generalized perfect arrays, and cocyclic Butson matrices
In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering Butson matrices that are cocyclic rather than strictly group invariant. This result has several applications; for example, to the construction of Boolean functions whose expansions are generalized partially bent functions, including cases where no bent function can exist.
- 29 September 2022
- Published by Santander. Estudios de Patrimonio. Editorial de la Universidad de Cantabria
XVII Reunión española sobre criptología y seguridad de la información. RECSI 2022
La Reunión Española sobre Criptología y Seguridad de la Información (RECSI) es el congreso científico referente español en el tema de la Seguridad en las Tecnologías de la Información y Comunicación, donde se dan cita de forma bienal los principales investigadores españoles en el tema, así como invitados extranjeros de reconocido prestigio. En estos encuentros se muestran los avances de los grupos de investigación que presentan comunicaciones y fomentan la participación de los jóvenes investigadores. Este libro recoge los resúmenes de las conferencias plenarias junto con los trabajos presentados en la XVII RECSI celebrada en Santander del 19 al 21 de Octubre de 2022 organizada por el grupo de investigación AMAC (Algorithmic Mathematics And Cryptography) de la Universidad de Cantabria.
- 29 September 2022
- Published by Santander. Estudios de Patrimonio. Editorial de la Universidad de Cantabria
XVII Reunión española sobre criptología y seguridad de la información. RECSI 2022
La Reunión Española sobre Criptología y Seguridad de la Información (RECSI) es el congreso científico referente español en el tema de la Seguridad en las Tecnologías de la Información y Comunicación, donde se dan cita de forma bienal los principales investigadores españoles en el tema, así como invitados extranjeros de reconocido prestigio. En estos encuentros se muestran los avances de los grupos de investigación que presentan comunicaciones y fomentan la participación de los jóvenes investigadores. Este libro recoge los resúmenes de las conferencias plenarias junto con los trabajos presentados en la XVII RECSI celebrada en Santander del 19 al 21 de Octubre de 2022 organizada por el grupo de investigación AMAC (Algorithmic Mathematics And Cryptography) de la Universidad de Cantabria.
- Open Access
- 17 September 2022
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (2) , 333-351
Butson full propelinear codes
In this paper we study Butson Hadamard matrices, and codes over finite rings coming from these matrices in logarithmic form, called BH-codes. We introduce a new morphism of Butson Hadamard matrices through a generalized Gray map on the matrices in logarithmic form, which is comparable to the morphism given in a recent note of Ó Catháin and Swartz. That is, we show how, if given a Butson Hadamard matrix over the $$k{\mathrm{th}}$$ roots of unity, we can construct a larger Butson matrix over the $$\ell \mathrm{th}$$ roots of unity for any $$\ell $$ dividingk, provided that any primepdividingkalso divides $$\ell $$ . We prove that a $${\mathbb {Z}}_{p^s}$$ -additive code withpa prime number is isomorphic as a group to a BH-code over $${\mathbb {Z}}_{p^s}$$ and the image of this BH-code under the Gray map is a BH-code over $${\mathbb {Z}}_p$$ (binary Hadamard code for $$p=2$$ ). Further, we investigate the inherent propelinear structure of these codes (and their images) when the Butson matrix is cocyclic. Some structural properties of these codes are studied and examples are provided.- 17 September 2022
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (2) , 333-351
Open AccessButson full propelinear codes
In this paper we study Butson Hadamard matrices, and codes over finite rings coming from these matrices in logarithmic form, called BH-codes. We introduce a new morphism of Butson Hadamard matrices through a generalized Gray map on the matrices in logarithmic form, which is comparable to the morphism given in a recent note of Ó Catháin and Swartz. That is, we show how, if given a Butson Hadamard matrix over the $$k{\mathrm{th}}$$ roots of unity, we can construct a larger Butson matrix over the $$\ell \mathrm{th}$$ roots of unity for any $$\ell $$ dividingk, provided that any primepdividingkalso divides $$\ell $$ . We prove that a $${\mathbb {Z}}_{p^s}$$ -additive code withpa prime number is isomorphic as a group to a BH-code over $${\mathbb {Z}}_{p^s}$$ and the image of this BH-code under the Gray map is a BH-code over $${\mathbb {Z}}_p$$ (binary Hadamard code for $$p=2$$ ). Further, we investigate the inherent propelinear structure of these codes (and their images) when the Butson matrix is cocyclic. Some structural properties of these codes are studied and examples are provided. - Open Access
- 1 September 2022
- Published by Springer Nature in Research Square
Generalized partially bent functions, generalized perfect arrays and cocyclic Butson matrices
In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets.We establish a broader network of equivalencesby considering Butson matrices that are cocyclic rather than strictly group invariant.This result has several applications; for example,to the construction of Boolean functions whose expansions are generalized partially bent functions, including cases where no bent function can exist.Mathematics Subject Classification (2010) 15B34 · 05B20 · 94D05
- 1 September 2022
- Published by Springer Nature in Research Square
Open AccessGeneralized partially bent functions, generalized perfect arrays and cocyclic Butson matrices
In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets.We establish a broader network of equivalencesby considering Butson matrices that are cocyclic rather than strictly group invariant.This result has several applications; for example,to the construction of Boolean functions whose expansions are generalized partially bent functions, including cases where no bent function can exist.Mathematics Subject Classification (2010) 15B34 · 05B20 · 94D05
- Open Access
Generalized partially bent functions, generalized perfect arrays and cocyclic Butson matrices
In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering Butson matrices that are cocyclic rather than strictly group invariant. This result has several applications; for example, to the construction of Boolean functions whose expansions are generalized partially bent functions, including cases where no bent function can exist.
Open AccessGeneralized partially bent functions, generalized perfect arrays and cocyclic Butson matrices
In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering Butson matrices that are cocyclic rather than strictly group invariant. This result has several applications; for example, to the construction of Boolean functions whose expansions are generalized partially bent functions, including cases where no bent function can exist.
- Open Access
- 14 April 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (8) , 857
Hadamard Matrices with Cocyclic Core
Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s, it has revealed itself as a powerful technique for looking for (cocyclic) Hadamard matrices. Ten years later, the series of papers by Kotsireas, Koukouvinos and Seberry about Hadamard matrices with one or two circulant cores introduced a different structured approach to the Hadamard conjecture. This paper is built on both strengths, so that Hadamard matrices with cocyclic cores are introduced and studied. They are proved to strictly include usual Hadamard matrices with one and two circulant cores, and therefore provide a wiser uniform approach to a structured Hadamard conjecture.
- 14 April 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (8) , 857
Open AccessHadamard Matrices with Cocyclic Core
Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s, it has revealed itself as a powerful technique for looking for (cocyclic) Hadamard matrices. Ten years later, the series of papers by Kotsireas, Koukouvinos and Seberry about Hadamard matrices with one or two circulant cores introduced a different structured approach to the Hadamard conjecture. This paper is built on both strengths, so that Hadamard matrices with cocyclic cores are introduced and studied. They are proved to strictly include usual Hadamard matrices with one and two circulant cores, and therefore provide a wiser uniform approach to a structured Hadamard conjecture.
- 19 January 2021
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 89 (4) , 599-615
Generalized Hadamard full propelinear codes
- 19 January 2021
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 89 (4) , 599-615
Generalized Hadamard full propelinear codes