Adrián Torres-Martín
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Adrián Torres-Martín has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Mercè Villanueva
Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, Cerdanyola del Vallès, Spain
4 shared publications - Carlos Vela
Institute of Computer Science, University of St. Gallen, St. Gallen, Switzerland
1 shared publication - Cristina Fernández-Córdoba
Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, Cerdanyola del Vallès, Spain
1 shared publication - Jerónimo Hernández-González
University of the Basque Country UPV/EHU
1 shared publication - Jesus Cerquides
Artificial Intelligence Research Institute, IIIA-CSIC, Spain
1 shared publication - Josep Rifà
Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, Cerdanyola del Vallès, Spain
1 shared publication
Latest Publications
- Open Access
- 22 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (12) , 8675-8687
Improving Explicit Constructions of r-PD-Sets for Zₚs-Linear Generalized Hadamard Codes
It is known that Z ps -linear codes, which are the Gray map image of Z ps -additive codes (linear codes over Z ps ), are systematic and a systematic encoding has been found. This makes Z ps -linear codes suitable to apply the permutation decoding method, based on the existence of r -PD-sets, which are subsets of the permutation automorphism group of the code. Some constructions of r -PD-sets of minimum size r +1 for Z ps -linear generalized Hadamard codes of type ( n ; t 1 , …, ts ) are known. In this paper, for these codes, we present new constructions of r -PD-sets of size r +1, which are suitable for all parameters t 1 , …, ts . These allow us to obtain new r -PD-sets for values of r closer to the theoretical upper bound, improving previous known results.
- 22 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (12) , 8675-8687
Open AccessImproving Explicit Constructions of r-PD-Sets for Zₚs-Linear Generalized Hadamard Codes
It is known that Z ps -linear codes, which are the Gray map image of Z ps -additive codes (linear codes over Z ps ), are systematic and a systematic encoding has been found. This makes Z ps -linear codes suitable to apply the permutation decoding method, based on the existence of r -PD-sets, which are subsets of the permutation automorphism group of the code. Some constructions of r -PD-sets of minimum size r +1 for Z ps -linear generalized Hadamard codes of type ( n ; t 1 , …, ts ) are known. In this paper, for these codes, we present new constructions of r -PD-sets of size r +1, which are suitable for all parameters t 1 , …, ts . These allow us to obtain new r -PD-sets for values of r closer to the theoretical upper bound, improving previous known results.
- Open Access
- 18 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (5) , 3447-3456
Computing Efficiently a Parity-Check Matrix for ℤ p s -Additive Codes
The $\mathbb {Z}_{p^{s}}$ -additive codes of length n are subgroups of $\mathbb {Z}_{p^{s}}^{n}$ , with p prime and $s\geq 1$ . They can be seen as a generalization of linear codes over $\mathbb {Z}_{2}$ , $\mathbb {Z}_{4}$ , or more general over $\mathbb {Z}_{2^{s}}$ . In this paper, we show two methods for computing a parity-check matrix of a $\mathbb {Z}_{p^{s}}$ -additive code from a generator matrix of the code in standard form. We also compare the performance of our results implemented in Magma with the current available function in Magma for linear codes over finite rings in general. Complementing this comparison, we also show a time complexity analysis of the algorithms. The rings $\mathbb {Z}_{p^{s}}$ belong to a more general class of rings: finite chain rings. Along the paper, we observe that the same results can be applied to any linear code over a finite commutative chain ring.
- 18 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (5) , 3447-3456
Open AccessComputing Efficiently a Parity-Check Matrix for ℤ p s -Additive Codes
The $\mathbb {Z}_{p^{s}}$ -additive codes of length n are subgroups of $\mathbb {Z}_{p^{s}}^{n}$ , with p prime and $s\geq 1$ . They can be seen as a generalization of linear codes over $\mathbb {Z}_{2}$ , $\mathbb {Z}_{4}$ , or more general over $\mathbb {Z}_{2^{s}}$ . In this paper, we show two methods for computing a parity-check matrix of a $\mathbb {Z}_{p^{s}}$ -additive code from a generator matrix of the code in standard form. We also compare the performance of our results implemented in Magma with the current available function in Magma for linear codes over finite rings in general. Complementing this comparison, we also show a time complexity analysis of the algorithms. The rings $\mathbb {Z}_{p^{s}}$ belong to a more general class of rings: finite chain rings. Along the paper, we observe that the same results can be applied to any linear code over a finite commutative chain ring.
- Open Access
- 20 October 2023
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 93
Partial permutation decoding and PD-sets for -linear generalized Hadamard codes- 20 October 2023
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 93
Open AccessPartial permutation decoding and PD-sets for -linear generalized Hadamard codes - Open Access
- 5 October 2022
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 150, 106160
Modeling three sources of uncertainty in assisted reproductive technologies with probabilistic graphical models
- 5 October 2022
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 150, 106160
Open AccessModeling three sources of uncertainty in assisted reproductive technologies with probabilistic graphical models
- 4 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (7) , 4435-4443
Systematic Encoding and Permutation Decoding for Zps-Linear Codes
Linear codes over $\mathbb {Z}_{p^{s}}$ of length $n$ are subgroups of $\mathbb {Z}_{p^{s}}^{n}$ . These codes are also called $\mathbb {Z}_{p^{s}}$ -additive codes and can be seen as a generalization of linear codes over $\mathbb {Z}_{2}$ and $\mathbb {Z}_{4}$ . A $\mathbb {Z}_{p^{s}}$ -linear code is a code over $\mathbb {Z}_{p}$ , not necessarily linear, which is the generalized Gray map image of a $\mathbb {Z}_{p^{s}}$ -additive code. In 2015, a systematic encoding was found for $\mathbb {Z}_{4}$ -linear codes. Moreover, an alternative permutation decoding method, which is suitable for any binary code (not necessarily linear) with a systematic encoding, was established. In this paper, we generalize these results by presenting a systematic encoding for any $\mathbb {Z}_{p^{s}}$ -linear code with $s\geq 2$ and $p$ prime. We also describe a permutation decoding method for any systematic code over $\mathbb {Z}_{p}$ , not necessarily linear, and show some examples of how to use this systematic encoding in this decoding method.
- 4 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (7) , 4435-4443
Systematic Encoding and Permutation Decoding for Zps-Linear Codes
Linear codes over $\mathbb {Z}_{p^{s}}$ of length $n$ are subgroups of $\mathbb {Z}_{p^{s}}^{n}$ . These codes are also called $\mathbb {Z}_{p^{s}}$ -additive codes and can be seen as a generalization of linear codes over $\mathbb {Z}_{2}$ and $\mathbb {Z}_{4}$ . A $\mathbb {Z}_{p^{s}}$ -linear code is a code over $\mathbb {Z}_{p}$ , not necessarily linear, which is the generalized Gray map image of a $\mathbb {Z}_{p^{s}}$ -additive code. In 2015, a systematic encoding was found for $\mathbb {Z}_{4}$ -linear codes. Moreover, an alternative permutation decoding method, which is suitable for any binary code (not necessarily linear) with a systematic encoding, was established. In this paper, we generalize these results by presenting a systematic encoding for any $\mathbb {Z}_{p^{s}}$ -linear code with $s\geq 2$ and $p$ prime. We also describe a permutation decoding method for any systematic code over $\mathbb {Z}_{p}$ , not necessarily linear, and show some examples of how to use this systematic encoding in this decoding method.