José Joaquín Bernal

Orcid: 0000-0002-4284-3087

Affiliations:
  • University of Murcia, Spain


According to our database1, José Joaquín Bernal authored at least 25 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Generalized Reed-Muller Codes: A New Construction of Information Sets.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
New advances in permutation decoding of first-order Reed-Muller codes.
Finite Fields Their Appl., June, 2023

Hyperbolic Sets in Incomplete Tables.
Proceedings of the IEEE Information Theory Workshop, 2023

2021
A New Approach to the Berlekamp-Massey-Sakata Algorithm: Improving Locator Decoding.
IEEE Trans. Inf. Theory, 2021

2020
Constructions of Abelian Codes Multiplying Dimension of Cyclic Codes.
Math. Comput. Sci., 2020

Decoding up to 4 Errors in Hyperbolic-Like Abelian Codes by the Sakata Algorithm.
Proceedings of the Arithmetic of Finite Fields - 8th International Workshop, 2020

2019
From ds-Bounds for Cyclic Codes to True Minimum Distance for Abelian Codes.
IEEE Trans. Inf. Theory, 2019

2018
Information Sets From Defining Sets for Reed-Muller Codes of First and Second Order.
IEEE Trans. Inf. Theory, 2018

2017
From ds-bounds for cyclic codes to true distance for abelian codes.
CoRR, 2017

Reed-Muller Codes: Information Sets from Defining Sets.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016
Apparent Distance and a Notion of BCH Multivariate Codes.
IEEE Trans. Inf. Theory, 2016

Cyclic and BCH codes whose minimum distance equals their maximum BCH bound.
Adv. Math. Commun., 2016

Ds-bounds for cyclic codes: New bounds for abelian codes.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

2015
Permutation decoding of ℤ<sub>2</sub>ℤ<sub>4</sub>-linear codes.
Des. Codes Cryptogr., 2015

A notion of multivariate BCH bounds and codes.
ACM Commun. Comput. Algebra, 2015

2014
Information sets in abelian codes: defining sets and Groebner basis.
Des. Codes Cryptogr., 2014

2013
Partial Permutation Decoding for Abelian Codes.
IEEE Trans. Inf. Theory, 2013

Permutation decoding of Z2Z4-linear codes
CoRR, 2013

Computing the Camion's multivariate BCH bound.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

2011
Information Sets From Defining Sets in Abelian Codes.
IEEE Trans. Inf. Theory, 2011

2010
Information sets for abelian codes.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2009
An intrinsical description of group codes.
Des. Codes Cryptogr., 2009

Group code structures on affine-invariant codes
CoRR, 2009

There Are Not Non-obvious Cyclic Affine-invariant Codes.
Proceedings of the Applied Algebra, 2009

2008
How to Know if a Linear Code Is a Group Code?.
Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008


  Loading...