Joaquim Borges
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
Joaquim Borges has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Josep Rifà
Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, Cerdanyola del Vallès, Spain
18 shared publications - Cristina Fernández-Córdoba
Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, Cerdanyola del Vallès, Spain
14 shared publications - Victor Alexandrovich Zinoviev
A.A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
12 shared publications - Roger Ten-Valls
Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, 08193-Bellaterra, Spain
6 shared publications - Steven T. Dougherty
University of Scranton
4 shared publications - Ivan Bailera
Department of Information and Communications Engineering Universitat Autònoma de Barcelona Spain
3 shared publications
Latest Publications
- Open Access
- 19 May 2026
- Published by Institute of Mathematics and Informatics Bulgarian Academy of Sciences in Mathematics and Education in Mathematics
- Vol. 55, 350-356
On maximum distance separable and completely regular codes
We investigate when a maximum distance separable (MDS) code over Fq is also completely regular (CR). For lengths n = q + 1 and n = q + 2 we provide a complete classification of the MDS codes that are CR or at least uniformly packed in the wide sense (UPWS). For the more restricted case n <= q with q <= 5 we obtain a full classification (up to equivalence) of all nontrivial MDS codes: there are none for q = 2; only the ternary Hamming code for q = 3; four nontrivial families for q = 4; and exactly six linear MDS codes for q = 5 (three of which are CR and one admits a self-dual version). Additionally, we close two gaps left open in a previous classification of self-dual CR codes with covering radius ρ <= 3: we precisely determine over which finite fields the MDS self-dual completely regular codes with parameters [2, 1, 2]_q and [4, 2, 3]_q exist.
- 19 May 2026
- Published by Institute of Mathematics and Informatics Bulgarian Academy of Sciences in Mathematics and Education in Mathematics
- Vol. 55, 350-356
Open AccessOn maximum distance separable and completely regular codes
We investigate when a maximum distance separable (MDS) code over Fq is also completely regular (CR). For lengths n = q + 1 and n = q + 2 we provide a complete classification of the MDS codes that are CR or at least uniformly packed in the wide sense (UPWS). For the more restricted case n <= q with q <= 5 we obtain a full classification (up to equivalence) of all nontrivial MDS codes: there are none for q = 2; only the ternary Hamming code for q = 3; four nontrivial families for q = 4; and exactly six linear MDS codes for q = 5 (three of which are CR and one admits a self-dual version). Additionally, we close two gaps left open in a previous classification of self-dual CR codes with covering radius ρ <= 3: we precisely determine over which finite fields the MDS self-dual completely regular codes with parameters [2, 1, 2]_q and [4, 2, 3]_q exist.
- Open Access
- 29 March 2025
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 105
On self-dual completely regular codes with covering radius ρ ≤ 3
- 29 March 2025
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 105
Open AccessOn self-dual completely regular codes with covering radius ρ ≤ 3
- 15 September 2023
- Published by The Russian Academy of Sciences in Problemy peredači informacii
- Vol. 59 (3) , 26-39
On the Classification of Completely Regular Codes with Covering Radius Two and Antipodal Duals
We classify all linear completely regular codes which have covering radiusρ=2and whose dual are antipodal. For this, we firstly show several properties of such dual codes, which are two-weight codes with weightsdandn.
- 15 September 2023
- Published by The Russian Academy of Sciences in Problemy peredači informacii
- Vol. 59 (3) , 26-39
On the Classification of Completely Regular Codes with Covering Radius Two and Antipodal Duals
We classify all linear completely regular codes which have covering radiusρ=2and whose dual are antipodal. For this, we firstly show several properties of such dual codes, which are two-weight codes with weightsdandn.
- 1 July 2023
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 59 (3) , 204-216
On the Classification of Completely Regular Codes with Covering Radius Two and Antipodal Duals
We classify all linear completely regular codes which have covering radius \(\rho=2\) and whose dual are antipodal. For this, we firstly show several properties of such dual codes, which are two-weight codes with weights \(d\) and \(n\).- 1 July 2023
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 59 (3) , 204-216
On the Classification of Completely Regular Codes with Covering Radius Two and Antipodal Duals
We classify all linear completely regular codes which have covering radius \(\rho=2\) and whose dual are antipodal. For this, we firstly show several properties of such dual codes, which are two-weight codes with weights \(d\) and \(n\).- Open Access
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 15 (1) , 35-54
On Hadamard full propelinear codes with associated group $ C_{2t}\times C_2 $We introduce the Hadamard full propelinear codes that factorize as direct product of groups such that their associated group is$ C_{2t}\times C_2 $ . We study the rank, the dimension of the kernel, and the structure of these codes. For several specific parameters we establish some links from circulant Hadamard matrices and the nonexistence of the codes we study. We prove that the dimension of the kernel of these codes is bounded by$ 3 $ if the code is nonlinear. We also get an equivalence between circulant complex Hadamard matrix and a type of Hadamard full propelinear code, and we find a new example of circulant complex Hadamard matrix of order$ 16 $ .- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 15 (1) , 35-54
Open AccessOn Hadamard full propelinear codes with associated group $ C_{2t}\times C_2 $We introduce the Hadamard full propelinear codes that factorize as direct product of groups such that their associated group is$ C_{2t}\times C_2 $ . We study the rank, the dimension of the kernel, and the structure of these codes. For several specific parameters we establish some links from circulant Hadamard matrices and the nonexistence of the codes we study. We prove that the dimension of the kernel of these codes is bounded by$ 3 $ if the code is nonlinear. We also get an equivalence between circulant complex Hadamard matrix and a type of Hadamard full propelinear code, and we find a new example of circulant complex Hadamard matrix of order$ 16 $ . - 1 March 2020
- Published by Elsevier in Discrete Mathematics
- Vol. 343 (3) , 111732
On completely regular and completely transitive supplementary codes
- 1 March 2020
- Published by Elsevier in Discrete Mathematics
- Vol. 343 (3) , 111732
On completely regular and completely transitive supplementary codes
- 1 July 2019
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 55 (3) , 298
Erratum to: On Completely Regular Codes
—We correct mistakes in the formulations of Theorem 19 and Proposition 17 of the original article, published in vol. 55, no. 1, 1–45.
- 1 July 2019
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 55 (3) , 298
Erratum to: On Completely Regular Codes
—We correct mistakes in the formulations of Theorem 19 and Proposition 17 of the original article, published in vol. 55, no. 1, 1–45.
- Open Access
Hadamard full propelinear codes with associated group $C_{2t}\times C_2$; rank and kernel
We introduce the Hadamard full propelinear codes that factorize as direct product of groups such that their associated group is $C_{2t}\times C_2$. We study the rank, the dimension of the kernel, and the structure of these codes. For several specific parameters we establish some links from circulant Hadamard matrices and the nonexistence of the codes we study. We prove that the dimension of the kernel of these codes is bounded by 3 if the code is nonlinear. We also get an equivalence between circulant complex Hadamard matrix and a type of Hadamard full propelinear code, and we find a new example of circulant complex Hadamard matrix of order 16.Open AccessHadamard full propelinear codes with associated group $C_{2t}\times C_2$; rank and kernel
We introduce the Hadamard full propelinear codes that factorize as direct product of groups such that their associated group is $C_{2t}\times C_2$. We study the rank, the dimension of the kernel, and the structure of these codes. For several specific parameters we establish some links from circulant Hadamard matrices and the nonexistence of the codes we study. We prove that the dimension of the kernel of these codes is bounded by 3 if the code is nonlinear. We also get an equivalence between circulant complex Hadamard matrix and a type of Hadamard full propelinear code, and we find a new example of circulant complex Hadamard matrix of order 16. - 1 January 2019
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 55 (1) , 1-45
On Completely Regular Codes
This work is a survey on completely regular codes. Known properties, relations with other combinatorial structures, and construction methods are considered. The existence problem is also discussed,...
- 1 January 2019
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 55 (1) , 1-45
On Completely Regular Codes
This work is a survey on completely regular codes. Known properties, relations with other combinatorial structures, and construction methods are considered. The existence problem is also discussed,...
- 1 December 2018
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 12 (4) , 419-428
Quasi-Hadamard Full Propelinear Codes
- 1 December 2018
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 12 (4) , 419-428
Quasi-Hadamard Full Propelinear Codes