Horacio Tapia-Recillas

According to our database1, Horacio Tapia-Recillas authored at least 22 papers between 1993 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
On the dimension of ideals in group algebras, and group codes.
CoRR, 2020

2019
The dual of a constacyclic code, self dual, reversible constacyclic codes and constacyclic codes with complementary duals over finite local Frobenius non-chain rings with nilpotency index 3.
Discret. Math., 2019

Projective Reed-Muller type codes on higher dimensional scrolls.
Des. Codes Cryptogr., 2019

2018
On <i>k</i>-normal elements over finite fields.
Finite Fields Their Appl., 2018

Duals of constacyclic codes over finite local Frobenius non-chain rings of length 4.
Discret. Math., 2018

2017
Constacyclic codes over finite local Frobenius non-chain rings with nilpotency index 3.
Finite Fields Their Appl., 2017

F<sub>q</sub>[G]-modules and G-invariant codes.
CoRR, 2017

Proof of Correspondence between Keys and Encoding Maps in an Authentication Code.
CoRR, 2017

2015
An Authentication Code over Galois Rings with Optimal Impersonation and Substitution Probabilities.
IACR Cryptol. ePrint Arch., 2015

2013
Systematic Authentication Codes Based on a Class of Bent Functions and the Gray Map on a Galois Ring.
SIAM J. Discret. Math., 2013

2012
Bent functions on a Galois ring and systematic authentication codes.
Adv. Math. Commun., 2012

2008
On the Quasi-cyclicity of the Gray Map Image of a Class of Codes over Galois Rings.
Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

2006
Some Results on Codes over Galois Rings.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

2003
On Z<sub>2</sub>k-Linear and Quaternary Codes.
SIAM J. Discret. Math., 2003

Some Constacyclic Codes Over Z<sub>2</sub>k and Binary Quasi-cyclic Codes.
Discret. Appl. Math., 2003

The Gray Map on GR(p<sup>2</sup>, n) and Repeated-Root Cyclic Codes.
Proceedings of the Finite Fields and Applications, 2003

2001
A Generalization of Negacyclic Codes.
Electron. Notes Discret. Math., 2001

An Upper Bound on the Number of Iterations for Transforming a Boolean Function of Degree Greater or Equal Than 4 to a Function of Degree 3.
Des. Codes Cryptogr., 2001

Reed-Muller Codes on Complete Intersections.
Appl. Algebra Eng. Commun. Comput., 2001

1999
The a-invariant of some Reed-Muller Codes.
Appl. Algebra Eng. Commun. Comput., 1999

1997
Some Results on Regular Mappings.
Proceedings of the Applied Algebra, 1997

1993
Energy Functions Associated with Error-Correcting Codes.
Proceedings of the Applied Algebra, 1993


  Loading...