Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Oscar E. González

dblp:164/2519 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
0000-0003-4556-4806ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 33% Computational complexity · 33% Mathematical optimization · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
boolean functions
0.312018
Diophantine Equations With Binomial Coefficients and Perturbations of Symmetric Boolean Functions · IEEE Trans. Inf. Theory 2018
Mathematical optimization › parametric optimization
perturbation analysis
0.312018
Diophantine Equations With Binomial Coefficients and Perturbations of Symmetric Boolean Functions · IEEE Trans. Inf. Theory 2018
Computational complexity › boolean function analysis
symmetric functions
0.312018
Diophantine Equations With Binomial Coefficients and Perturbations of Symmetric Boolean Functions · IEEE Trans. Inf. Theory 2018

Methods — techniques the papers use, named apart from their topics

exponential sums · 0.3
YearPublicationVenuePosition
2018 New families of balanced symmetric functions and a generalization of Cusick, Li and Stǎnicǎ's conjecture
Rafael A. Arce-Nazario, Francis N. Castro, Oscar E. González, Luis A. Medina, Ivelisse Rubio
Des. Codes Cryptogr.3
2018 Diophantine Equations With Binomial Coefficients and Perturbations of Symmetric Boolean Functions
abstract
This paper presents a study of perturbations of symmetric Boolean functions. In particular, it establishes a connection between exponential sums of these perturbations and Diophantine equations of the form Σl=0n(nl)xl= 0, where xjbelongs to some fixed bounded subset Γ of Z. The concepts of trivially balanced symmetric Boolean function and sporadic balanced Boolean function are extended to this type of perturbations. An observation made by Canteaut and Videau for symmetric Boolean functions of fixed degree is extended. To be specific, it is proved that, excluding the trivial cases, balanced perturbations of fixed degree do not exist when the number of variables grows. Some sporadic balanced perturbations are presented. Finally, a beautiful but unexpected identity between exponential sums for perturbations of two different symmetric Boolean functions is also included in this work.
Francis N. Castro, Oscar E. González, Luis A. Medina
IEEE Trans. Inf. Theory2