Josep Rifà
Orcid: 0000-0001-9199-4001
According to our database1,
Josep Rifà
authored at least 95 papers
between 1985 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1985
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
3
1
2
2
2
3
2
2
4
4
2
4
2
6
6
3
2
2
2
2
1
4
2
3
1
1
1
2
2
1
1
1
1
1
1
1
1
1
1
1
1
2
1
1
2
1
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on ccd.uab.es
On csauthors.net:
Bibliography
2024
Improving Explicit Constructions of r-PD-Sets for Zₚs-Linear Generalized Hadamard Codes.
IEEE Trans. Inf. Theory, December, 2024
Probl. Inf. Transm., December, 2024
Discret. Math., April, 2024
2022
IEEE Access, 2022
2021
IEEE Trans. Inf. Theory, 2021
On Hadamard full propelinear codes with associated group C<sub>2t</sub>˟ C<sub>2</sub>.
Adv. Math. Commun., 2021
2020
Discret. Math., 2020
Proceedings of the IEEE International Symposium on Information Theory, 2020
2019
2018
Des. Codes Cryptogr., 2018
2017
Electron. Notes Discret. Math., 2017
Completely regular codes with different parameters giving the same distance-regular coset graphs.
Discret. Math., 2017
2016
IEEE Trans. Inf. Theory, 2016
Electron. Notes Discret. Math., 2016
2015
Construction of Hadamard ℤ<sub>2</sub> ℤ<sub>4</sub> Q<sub>8</sub>-Codes for Each Allowable Value of the Rank and Dimension of the Kernel.
IEEE Trans. Inf. Theory, 2015
Self-embeddings of Hamming Steiner triple systems of small order and APN permutations.
Des. Codes Cryptogr., 2015
Des. Codes Cryptogr., 2015
Adv. Math. Commun., 2015
2014
Discret. Math., 2014
Discret. Math., 2014
New families of completely regular codes and their corresponding distance regular coset graphs.
Des. Codes Cryptogr., 2014
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014
2013
IEEE Trans. Inf. Theory, 2013
Electron. J. Comb., 2013
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
2012
2011
Adv. Math. Commun., 2011
Proceedings of the 2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 2011
2010
IEEE Trans. Inf. Theory, 2010
<i>Z</i><sub>2</sub><i>Z</i><sub>4</sub>-linear codes: generator matrices and duality.
Des. Codes Cryptogr., 2010
Adv. Math. Commun., 2010
Proceedings of the International Symposium on Information Theory and its Applications, 2010
2009
IEEE Trans. Inf. Theory, 2009
IEEE Trans. Inf. Theory, 2009
On a class of binary linear completely transitive codes with arbitrary covering radius.
Discret. Math., 2009
On linear completely regular codes with covering radius rho=1. Construction and classification
CoRR, 2009
2008
IEEE Trans. Inf. Theory, 2008
Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008
2007
Proceedings of the Applied Algebra, 2007
2006
On the additive (ℤ<sub>4</sub>-linear and non-ℤ<sub>4</sub>-linear) Hadamard codes: rank and kernel.
IEEE Trans. Inf. Theory, 2006
Hadamard Codes of Length 2<sup><i>t</i></sup><i>s</i> (<i>s</i> Odd). Rank and Kernel.
Proceedings of the Applied Algebra, 2006
2005
Des. Codes Cryptogr., 2005
2003
IEEE Trans. Inf. Theory, 2003
The rank and kernel of extended 1-perfect Z<sub>4</sub>-linear and additive non-Z<sub>4</sub>-linear codes.
IEEE Trans. Inf. Theory, 2003
2002
IEEE Trans. Inf. Theory, 2002
2001
IEEE Trans. Inf. Theory, 2001
Electron. Notes Discret. Math., 2001
Electron. Notes Discret. Math., 2001
Appl. Algebra Eng. Commun. Comput., 2001
2000
Efficient construction of vote-tags to allow open objection to the tally in electronic elections.
Inf. Process. Lett., 2000
1999
SIAM J. Discret. Math., 1999
Des. Codes Cryptogr., 1999
1998
Inf. Process. Lett., 1998
1997
Large scale elections by coordinating electoral colleges.
Proceedings of the Information Security in Research and Business, 1997
1996
1995
Math. Syst. Theory, 1995
1993
Des. Codes Cryptogr., 1993
1991
Proceedings of the Applied Algebra, 1991
Improving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields.
Proceedings of the Applied Algebra, 1991
1990
Discret. Appl. Math., 1990
On a Categorial Isomorphism between a Class of Completely Regular Codes and a Class of Distance Regular Graphs.
Proceedings of the Applied Algebra, 1990
1988
1987
Proceedings of the Applied Algebra, 1987
Proceedings of the Applied Algebra, 1987
1986
Characterization of Completely Regular Codes through P-Polynomial Association Schemes.
Proceedings of the Applied Algebra, 1986
1985
Proceedings of the Algebraic Algorithms and Error-Correcting Codes, 1985
Proceedings of the Algebraic Algorithms and Error-Correcting Codes, 1985