3 citations · 3 across the 4 of their papers we have counts for
4 papers
Enumeration of Nilpotent Loops by Orbit Counting
Fariha Iftikhar, Gábor P. Nagy
We study central extensions of nilpotent loops by elementary abelian -groups using normalized cocycles. By introducing an affine automorphism group acting on the full cocycle sp…
Evaluation codes arising from symmetric polynomials
Barbara Gatti, Gábor Korchmáros, Gábor P. Nagy +2
Datta and Johnsen (Des. Codes and Cryptogr., {\bf{91}} (2023), 747-761) introduced a new family of evalutation codes in an affine space of dimension over a finite field $\m…
Algebraic approach to the completeness problem for -arcs in planes over finite fields
Gábor Korchmáros, Gábor Péter Nagy, Tamás Szőnyi
In a projective plane over a finite field, complete -arcs with few characters are rare but interesting objects with several applications to finite geometry and coding theory…
Thin Sidon sets and the nonlinearity of vectorial Boolean functions
Gábor Péter Nagy
The vectorial nonlinearity of a vector valued function is its distance from the set of affine functions. In 2017, Liu, Mesnager and Chen conjectured a general upper bound for the v…