default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatteo Bonini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Daniele Bartoli, Matteo Bonini
:
More on the DLW conjectures. Finite Fields Their Appl. 93: 102332 (2024)- [i13]Matteo Bonini, Martino Borello, Eimear Byrne:
The geometry of covering codes in the sum-rank metric. CoRR abs/2410.12393 (2024) - 2023
- [j8]Edoardo Ballico, Matteo Bonini:
On the weights of dual codes arising from the GK curve. Appl. Algebra Eng. Commun. Comput. 34(1): 67-79 (2023) - [j7]Matteo Bonini, Stefano Lia, Marco Timpanella:
Minimal linear codes from Hermitian varieties and quadrics. Appl. Algebra Eng. Commun. Comput. 34(2): 201-210 (2023) - 2022
- [i12]Matteo Bonini, Martino Borello, Eimear Byrne:
Saturating systems and the rank covering radius. CoRR abs/2206.14740 (2022) - [i11]Daniele Bartoli, Matteo Bonini, Marco Timpanella:
Minimal codewords in Norm-Trace codes. CoRR abs/2211.02329 (2022) - 2021
- [j6]Daniele Bartoli, Matteo Bonini, Burçin Günes:
An inductive construction of minimal codes. Cryptogr. Commun. 13(3): 439-449 (2021) - [j5]Daniele Bartoli, Matteo Bonini, Marco Timpanella:
On the weight distribution of some minimal codes. Des. Codes Cryptogr. 89(3): 471-487 (2021) - [i10]Matteo Bonini, Massimiliano Sala, Lara Vicino:
Rational points on cubic surfaces and AG codes from the Norm-Trace curve. CoRR abs/2102.05478 (2021) - 2020
- [j4]Matteo Bonini, Massimiliano Sala:
Intersections between the norm-trace curve and some low degree curves. Finite Fields Their Appl. 67: 101715 (2020) - [i9]Daniele Bartoli, Matteo Bonini, Marco Timpanella:
On the weight distribution of some minimal codes. CoRR abs/2004.13774 (2020)
2010 – 2019
- 2019
- [j3]Daniele Bartoli, Matteo Bonini:
Minimum weight codewords in dual algebraic-geometric codes from the Giulietti-Korchmáros curve. Des. Codes Cryptogr. 87(6): 1433-1445 (2019) - [j2]Daniele Bartoli, Matteo Bonini:
Minimal Linear Codes in Odd Characteristic. IEEE Trans. Inf. Theory 65(7): 4152-4155 (2019) - [i8]Daniele Bartoli, Matteo Bonini:
Planar Polynomials arising from Linearized polynomials. CoRR abs/1903.02112 (2019) - [i7]Matteo Bonini, Martino Borello:
Minimal linear codes arising from blocking sets. CoRR abs/1907.04626 (2019) - [i6]Edoardo Ballico, Matteo Bonini:
On the weights of dual codes arising from the GK curve. CoRR abs/1909.08126 (2019) - [i5]Daniele Bartoli, Matteo Bonini, Burçin Günes:
An inductive construction of minimal codes. CoRR abs/1911.09093 (2019) - 2018
- [i4]Daniele Bartoli, Matteo Bonini:
Minimum weight codewords in dual Algebraic-Geometric codes from the Giulietti-Korchmáros curve. CoRR abs/1802.03359 (2018) - [i3]Daniele Bartoli, Matteo Bonini:
Minimal linear codes in odd characteristic. CoRR abs/1811.06829 (2018) - [i2]Matteo Bonini, Massimiliano Sala:
Intersections between the norm-trace curve and some low degree curves. CoRR abs/1812.08590 (2018) - 2017
- [j1]Daniele Bartoli, Matteo Bonini, Massimo Giulietti:
Constant dimension codes from Riemann-Roch spaces. Adv. Math. Commun. 11(4): 705-713 (2017) - 2015
- [i1]Daniele Bartoli, Matteo Bonini, Massimo Giulietti:
Constant dimension codes from Riemann-Roch spaces. CoRR abs/1508.01727 (2015)
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-01-21 00:24 CET 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:
