2 citations · 3 across the 17 of their papers we have counts for
17 papers
A Note on the Theoretical Support to Compute Dimension in Abelian Codes
J. J. Bernal, J. J. Simón
In this note we give a theoretical support by means of quotient polynomial rings for the computation formulas of the dimension of abelian codes.
Hyperbolic Sets in Incomplete Tables
J. J. Bernal, J. J. Simón
In this paper, we extend results about the implementation of the Berlekamp-Massey-Sakata algorithm on data tables having a number of unknown values.
Inference of unknown syndrome values in the implementation of the Berlekamp-Massey-Sakata algorithm
J. J. Bernal, J. J. Simón
We study the problem of finding those missing syndrome values that are needed to implment the Berlekamp-Massey-Sakata algorithm as the Feng-Rao Majority Voting for algebraic geomet…
Permutation decoding of first-order Generalized Reed-Muller codes
José Joaquín Bernal, Juan Jacobo Simón
In [4] we describe a variation of the classical permutation decoding algorithm that can be applied to any binary affine-invariant code; in particular, it can be applied to first-or…
Constructions of Abelian Codes multiplying dimension of cyclic codes
José Joaquín Bernal, Diana H. Bueno-Carreño, Juan Jacobo Simón
In this note, we apply some techniques developed in [1]-[3] to give a particular construction of bivariate Abelian Codes from cyclic codes, multiplying their dimension and preservi…
Cyclic and BCH Codes whose Minimum Distance Equals their Maximum BCH bound
José Joaquín Bernal, Diana H. Bueno-Carreño, Juan Jacobo Simón
In this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that prope…