Joan-Josep Climent

Orcid: 0000-0003-0522-0304

According to our database1, Joan-Josep Climent authored at least 38 papers between 1995 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
A construction of 픽<sub>2</sub>-linear cyclic, MDS codes.
Adv. Math. Commun., 2020

2019
A construction of Abelian non-cyclic orbit codes.
Cryptogr. Commun., 2019

A Novel Construction for Streaming Networks with Delays.
Proceedings of the International Joint Conference: 12th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2019) and 10th International Conference on EUropean Transnational Education (ICEUTE 2019), 2019

2018
Boolean Functions: Degree and Support.
Math. Comput. Sci., 2018

Series concatenation of 2D convolutional codes by means of input-state-output representations.
Int. J. Control, 2018

2017
A Construction of Orbit Codes.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

Decoding a Perturbed Sequence Generated by an LFSR.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016
Maximum Distance Separable 2D Convolutional Codes.
IEEE Trans. Inf. Theory, 2016

Parallel concatenated convolutional codes from linear systems theory viewpoint.
Syst. Control. Lett., 2016

Public Key Protocols over the Ring E_p(m).
CoRR, 2016

Decoding of 2D convolutional codes over an erasure channel.
Adv. Math. Commun., 2016

Public key protocols over the ring E<sub>p</sub><sup>m</sup>.
Adv. Math. Commun., 2016

An approach to the performance of SPC product codes on the erasure channel.
Adv. Math. Commun., 2016

2015
Series concatenation of 2D convolutional codes.
Proceedings of the IEEE 9th International Workshop on Multidimensional (nD) Systems, 2015

2014
An extension of the noncommutative Bergman's ring with a large number of noninvertible elements.
Appl. Algebra Eng. Commun. Comput., 2014

Burst Erasure Correction of 2D Convolutional Codes.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

Input-State-Output Representation of Convolutional Product Codes.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

SPC Product Codes over the Erasure Channel.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

2012
Key exchange protocols over noncommutative rings. The case of.
Int. J. Comput. Math., 2012

Construction of bent functions of 2<i>k</i> variables from a basis of.
Int. J. Comput. Math., 2012

2011
On the arithmetic of the endomorphisms ring End(\mathbb<i>Z</i><sub><i>p</i></sub> ×\mathbb<i>Z</i><sub><i>p</i><sup>2</sup></sub>).
Appl. Algebra Eng. Commun. Comput., 2011

2010
Computing the degree of a Boolean function from its support.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

2009
A Systems Theory Approach to Periodically Time-Varying Convolutional Codes by Means of Their Invariant Equivalent.
Proceedings of the Applied Algebra, 2009

2008
On the construction of bent functions of <i>n+2</i> variables from bent functions of <i>n</i> variables.
Adv. Math. Commun., 2008

2007
Cryptanalysis of the CFVZ cryptosystem.
Adv. Math. Commun., 2007

2006
A nonlinear elliptic curve cryptosystem based on matrices.
Appl. Math. Comput., 2006

2005
An overlapped two-way method for solving tridiagonal linear systems in a BSP computer.
Appl. Math. Comput., 2005

An efficient binary sequence generator with cryptographic applications.
Appl. Math. Comput., 2005

2004
Sequential and parallel synchronous alternating iterative methods.
Math. Comput., 2004

Convergence theorems for parallel alternating iterative methods.
Appl. Math. Comput., 2004

A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system.
Appl. Math. Comput., 2004

2003
A note on the recursive decoupling method for solving tridiagonal linear systems.
Appl. Math. Comput., 2003

Convergence and comparison theorems for a generalized alternating iterative method.
Appl. Math. Comput., 2003

A Pseudorandom Bit Generator Based on Block Upper Triangular Matrices.
Proceedings of the Web Engineering, International Conference, 2003

1999
Convergence and comparison theorems for multisplittings.
Numer. Linear Algebra Appl., 1999

A BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix.
J. Parallel Distributed Comput., 1999

1998
On <i>M</i>-multisplittings of singular <i>M</i>-matrices with application to Markov chains.
Numer. Linear Algebra Appl., 1998

1995
On the Index of Block Upper Triangular Matrices.
SIAM J. Matrix Anal. Appl., 1995


  Loading...