default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGábor Péter Nagy
Person information
- affiliation: University of Szeged, Bolyai Institute, Hungary
- affiliation: Budapest University of Technology and Economics, Department of Algebra, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j26]Gábor Péter Nagy
:
Sidon sets, thin sets, and the nonlinearity of vectorial Boolean functions. J. Comb. Theory, Ser. A 212: 106001 (2025)- [i4]Gábor Péter Nagy:
On the minimum Hamming distance between vectorial Boolean and affine functions. CoRR abs/2503.03905 (2025) - 2024
- [j25]Sabira El Khalfaoui, Gábor Péter Nagy:
On the Dimensions of Hermitian Subfield Subcodes from Higher-Degree Places. Entropy 26(5): 386 (2024) - [j24]Gábor Korchmáros, Gábor Péter Nagy, Tamás Szonyi:
Algebraic approach to the completeness problem for (k,n)-arcs in planes over finite fields. J. Comb. Theory, Ser. A 204: 105851 (2024) - [j23]Márton Erdélyi, Pál Hegedüs, Sándor Z. Kiss, Gábor Péter Nagy:
On linear codes with random multiplier vectors and the maximum trace dimension property. J. Math. Cryptol. 18(1) (2024) - 2023
- [j22]Claude Carlet, Rebeka Kiss, Gábor Péter Nagy:
Simplicity conditions for binary orthogonal arrays. Des. Codes Cryptogr. 91(1): 151-163 (2023) - [i3]Márton Erdélyi, Pál Hegedüs, Sándor Z. Kiss, Gábor Péter Nagy:
On Linear Codes with Random Multiplier Vectors and the Maximum Trace Dimension Property. CoRR abs/2309.00687 (2023) - 2021
- [j21]Sabira El Khalfaoui, Gábor Péter Nagy:
On the dimension of the subfield subcodes of 1-point Hermitian codes. Adv. Math. Commun. 15(2): 219-226 (2021) - [j20]Gábor Korchmáros, Gábor Péter Nagy:
Graphical Frobenius representations of non-abelian groups. Ars Math. Contemp. 20(1): 89-102 (2021) - [j19]Dávid Mezofi, Gábor Péter Nagy:
New Steiner 2-designs from old ones by paramodifications. Discret. Appl. Math. 288: 114-122 (2021) - [j18]Gábor Péter Nagy:
Embeddings of Ree unitals in a projective plane over a field. Finite Fields Their Appl. 74: 101875 (2021) - 2020
- [j17]Gábor Péter Nagy, Sabira El Khalfaoui:
Estimating the Dimension of the Subfield Subcodes of Hermitian Codes. Acta Cybern. 24(4): 625-641 (2020) - [j16]Gábor Korchmáros, Gábor Péter Nagy, Marco Timpanella:
Codes and Gap Sequences of Hermitian Curves. IEEE Trans. Inf. Theory 66(6): 3547-3554 (2020) - [i2]Sabira El Khalfaoui, Gábor Péter Nagy:
Estimating The Dimension Of The Subfield Subcodes of Hermitian Codes. CoRR abs/2004.05896 (2020)
2010 – 2019
- 2019
- [j15]Dávid Mezofi, Gábor Péter Nagy:
On the geometry of full points of abstract unitals. Des. Codes Cryptogr. 87(12): 2967-2978 (2019) - [j14]Aart Blokhuis, István Kovács, Gábor Péter Nagy, Tamás Szonyi:
Inherited conics in Hall planes. Discret. Math. 342(4): 1098-1107 (2019) - [j13]Gábor Korchmáros, Gábor Péter Nagy, Pietro Speziali:
Hemisystems of the Hermitian surface. J. Comb. Theory A 165: 408-439 (2019) - [i1]Sabira El Khalfaoui, Gábor Péter Nagy:
On The Dimension of The Subfield Subcodes of 1-Point Hermitian Codes. CoRR abs/1906.10444 (2019) - 2018
- [j12]Gábor Korchmáros, Gábor Péter Nagy:
Group-labeled light dual multinets in the projective plane. Discret. Math. 341(8): 2121-2130 (2018) - 2016
- [j11]Gábor Korchmáros, Gábor Péter Nagy:
3-Nets realizing a diassociative loop in a projective plane. Des. Codes Cryptogr. 79(3): 443-449 (2016) - 2015
- [j10]Gábor Korchmáros, Gábor Péter Nagy, Nicola Pace:
k-nets embedded in a projective plane over a field. Comb. 35(1): 63-74 (2015) - [j9]Norbert Bogya, Gábor Korchmáros, Gábor Péter Nagy:
Classification of k-nets. Eur. J. Comb. 48: 177-185 (2015) - 2014
- [j8]Gábor Péter Nagy:
Linear groups as right multiplication groups of quasifields. Des. Codes Cryptogr. 72(1): 153-164 (2014) - 2013
- [j7]Gábor Péter Nagy, Nicola Pace:
On small 3-nets embedded in a projective plane over a field. J. Comb. Theory A 120(7): 1632-1641 (2013) - 2011
- [j6]Peter Müller, Gábor Péter Nagy:
On the non-existence of sharply transitive sets of permutations in certain finite permutation groups. Adv. Math. Commun. 5(2): 303-308 (2011) - [j5]Kenneth W. Johnson, Michael K. Kinyon, Gábor Péter Nagy, Petr Vojtechovský:
Searching for small simple automorphic loops. LMS J. Comput. Math. 14: 200-213 (2011) - [j4]Gábor Péter Nagy, Gyula Pap, Ágnes Szendrei:
Foreword. Period. Math. Hung. 63(2): 151 (2011) - 2010
- [j3]Gábor Péter Nagy:
On the multiplication groups of semifields. Eur. J. Comb. 31(1): 18-24 (2010)
2000 – 2009
- 2008
- [j2]Gábor Péter Nagy:
Direct construction of code loops. Discret. Math. 308(23): 5349-5357 (2008) - 2007
- [j1]Gábor Péter Nagy, Petr Vojtechovský:
The Moufang loops of order 64 and 81. J. Symb. Comput. 42(9): 871-883 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-22 21:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
