default search action
Marco Timpanella
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Marco Timpanella, Giovanni Zini
:
On a family of linear MRD codes with parameters [8˟ 8,16,7]q. Des. Codes Cryptogr. 92(3): 507-530 (2024) - [j14]Daniele Bartoli
Scattered trinomials of Fq6[X] in even characteristic. Finite Fields Their Appl. 97: 102449 (2024) - [j13]Marco Timpanella
On a generalization of the Deligne-Lusztig curve of Suzuki type and application to AG codes. J. Math. Cryptol. 18(1) (2024) - [j12]Leonardo Landi
Two-Point AG Codes From One of the Skabelund Maximal Curves. IEEE Trans. Inf. Theory 70(7): 4792-4798 (2024) - 2023
- [j11]Matteo Bonini, Stefano Lia
Minimal linear codes from Hermitian varieties and quadrics. Appl. Algebra Eng. Commun. Comput. 34(2): 201-210 (2023) - [j10]Stefano Lia
AG codes from 픽q7-rational points of the GK maximal curve. Appl. Algebra Eng. Commun. Comput. 34(4): 629-648 (2023) - [i7]Leonardo Landi, Marco Timpanella, Lara Vicino:
Two-point AG codes from one of the Skabelund maximal curves. CoRR abs/2306.15327 (2023) - 2022
- [j9]Daniele Bartoli, Marco Timpanella
On a conjecture on APN permutations. Cryptogr. Commun. 14(4): 925-931 (2022) - [j8]Daniele Bartoli, Massimo Giulietti
Two-to-one functions from Galois extensions. Discret. Appl. Math. 309: 194-201 (2022) - [j7]Daniele Bartoli, Marco Calderini, Marco Timpanella
Exceptional crooked functions. Finite Fields Their Appl. 84: 102109 (2022) - [c1]Massimo Giulietti, Arianna Sabatini, Marco Timpanella:
PIR Codes from Combinatorial Structures. WAIFI 2022: 169-182 - [i6]Daniele Bartoli, Matteo Bonini
Minimal codewords in Norm-Trace codes. CoRR abs/2211.02329 (2022) - 2021
- [j6]Daniele Bartoli
On the weight distribution of some minimal codes. Des. Codes Cryptogr. 89(3): 471-487 (2021) - [j5]Stefano Lia
Bound on the order of the decomposition groups of an algebraic curve in positive characteristic. Finite Fields Their Appl. 69: 101771 (2021) - [j4]Daniele Bartoli, Marco Timpanella
A family of permutation trinomials over Fq2. Finite Fields Their Appl. 70: 101781 (2021) - [j3]Daniele Bartoli, Marco Timpanella
On trinomials of type Xn+m(1 + AXm(q-1) + BXn(q-1)), n, m odd, over Fq2, q = 22s+1. Finite Fields Their Appl. 72: 101816 (2021) - [i5]Daniele Bartoli, Marco Timpanella:
On a conjecture on APN permutations. CoRR abs/2105.03702 (2021) - [i4]Massimo Giulietti, Arianna Sabatini, Marco Timpanella:
PIR codes from combinatorial structures. CoRR abs/2107.01169 (2021) - [i3]Marco Timpanella, Giovanni Zini:
On a family of linear MRD codes with parameters [8×8, 16, 7]q. CoRR abs/2108.13082 (2021) - 2020
- [j2]Daniele Bartoli, Marco Timpanella
A family of planar binomials in characteristic 2. Finite Fields Their Appl. 63: 101651 (2020) - [j1]Gábor Korchmáros, Gábor Péter Nagy
Codes and Gap Sequences of Hermitian Curves. IEEE Trans. Inf. Theory 66(6): 3547-3554 (2020) - [i2]Daniele Bartoli, Matteo Bonini, Marco Timpanella:
On the weight distribution of some minimal codes. CoRR abs/2004.13774 (2020)
2010 – 2019
- 2017
- [i1]Maria Montanucci, Marco Timpanella, Giovanni Zini:
AG codes and AG quantum codes from cyclic extensions of the Suzuki and Ree curves. CoRR abs/1709.05979 (2017)
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 2024-08-23 18:30 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: