default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdoardo Ballico
Person information
- affiliation: University of Trento, Department of Mathematics, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Edoardo Ballico
:
Minimal and Primitive Terracini Loci of a Four-Dimensional Projective Space. Axioms 13(1): 50 (2024)- [j27]Edoardo Ballico:
Terracini Loci, Linear Projections, and the Maximal Defect. Axioms 13(4): 271 (2024) - 2023
- [j26]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) - 2022
- [j25]Edoardo Ballico, Alessandra Bernardi, Emanuele Ventura:
Strict inclusions of high rank loci. J. Symb. Comput. 109: 238-249 (2022) - [j24]Edoardo Ballico:
Examples on the Non-Uniqueness of the Rank 1 Tensor Decomposition of Rank 4 Tensors. Symmetry 14(9): 1889 (2022) - [j23]Edoardo Ballico:
Terracini Loci of Segre Varieties. Symmetry 14(11): 2440 (2022) - 2021
- [j22]Edoardo Ballico, Giuseppe Favacchio, Elena Guardo, Lorenzo Milazzo:
Steiner systems and configurations of points. Des. Codes Cryptogr. 89(2): 199-219 (2021) - [j21]Edoardo Ballico:
Locally Recoverable Codes correcting many erasures over small fields. Des. Codes Cryptogr. 89(9): 2157-2162 (2021) - [j20]Edoardo Ballico:
Base Point Freeness, Uniqueness of Decompositions and Double Points for Veronese and Segre Varieties. Symmetry 13(12): 2344 (2021) - 2020
- [j19]Edoardo Ballico:
On the numerical range of matrices defined over a finite field. Finite Fields Their Appl. 67: 101730 (2020)
2010 – 2019
- 2019
- [i6]Edoardo Ballico, Matteo Bonini:
On the weights of dual codes arising from the GK curve. CoRR abs/1909.08126 (2019) - 2017
- [j18]Edoardo Ballico, Alessandro De Paris:
Generic Power Sum Decompositions and Bounds for the Waring Rank. Discret. Comput. Geom. 57(4): 896-914 (2017) - 2016
- [j17]Edoardo Ballico:
Non-special subsets of the set of points of a curve defined over a finite field. Des. Codes Cryptogr. 80(3): 453-457 (2016) - [j16]Edoardo Ballico, Chiara Marcolla:
Higher Hamming weights for locally recoverable codes on algebraic curves. Finite Fields Their Appl. 40: 61-72 (2016) - 2015
- [i5]Edoardo Ballico, Chiara Marcolla:
Higher Hamming weights for locally recoverable codes on algebraic curves. CoRR abs/1505.05041 (2015) - 2014
- [j15]Edoardo Ballico:
Any network code comes from an algebraic curve taking osculating spaces. Des. Codes Cryptogr. 73(3): 1023-1026 (2014) - 2013
- [j14]Edoardo Ballico, Alberto Ravagnani:
On the dual minimum distance and minimum weight of codes from a quotient of the Hermitian curve. Appl. Algebra Eng. Commun. Comput. 24(5): 343-354 (2013) - [j13]Edoardo Ballico, Alberto Ravagnani:
The dual geometry of Hermitian two-point codes. Discret. Math. 313(23): 2687-2695 (2013) - [j12]Edoardo Ballico, Alberto Ravagnani:
On the duals of geometric Goppa codes from norm-trace curves. Finite Fields Their Appl. 20: 30-39 (2013) - [j11]Edoardo Ballico, Michele Elia, Massimiliano Sala:
On the evaluation of multivariate polynomials over finite fields. J. Symb. Comput. 50: 255-262 (2013) - [i4]Edoardo Ballico:
Any network codes comes from an algebraic curve taking osculating spaces. CoRR abs/1306.0992 (2013) - 2012
- [j10]Edoardo Ballico:
Scroll codes over curves of higher genus: reducible and superstable vector bundles. Des. Codes Cryptogr. 63(3): 365-377 (2012) - [i3]Edoardo Ballico, Alberto Ravagnani:
On Goppa codes from norm-trace curves. CoRR abs/1205.6184 (2012) - [i2]Edoardo Ballico, Alberto Ravagnani:
On the minimum distance and the minimum weight of Goppa codes from a quotient of the Hermitian curve. CoRR abs/1212.0415 (2012) - 2011
- [j9]Edoardo Ballico:
Uniformity for geometric codes over large extensions of Fq. Finite Fields Their Appl. 17(4): 373-376 (2011) - [i1]Edoardo Ballico, Michele Elia, Massimiliano Sala:
Complexity of multivariate polynomial evaluation. CoRR abs/1106.2720 (2011)
2000 – 2009
- 2008
- [j8]Edoardo Ballico:
Vector bundles on curves over Fq and algebraic codes. Finite Fields Their Appl. 14(4): 1101-1107 (2008) - 2006
- [j7]Edoardo Ballico, Claudio Fontanari:
The Horace Method for Error-Correcting Codes. Appl. Algebra Eng. Commun. Comput. 17(2): 135-139 (2006) - 2004
- [j6]Edoardo Ballico, Ferruccio Orecchia:
Computing minimal generators of the ideal of a general projective curve. J. Symb. Comput. 37(3): 295-304 (2004) - 2002
- [j5]Edoardo Ballico, Antonio Cossidente:
Hermitian Veronesean Schemes. Des. Codes Cryptogr. 25(3): 311-317 (2002) - 2001
- [j4]Edoardo Ballico, Antonio Cossidente:
Finite field Nullstellensatz and Grassmannians. Australas. J Comb. 24: 313- (2001) - [j3]Edoardo Ballico, Antonio Cossidente:
Curves in Projective Spaces and Almost MDS Codes. Des. Codes Cryptogr. 24(2): 233-237 (2001) - 2000
- [j2]Edoardo Ballico, Antonio Cossidente:
On the finite field Nullstellensatz. Australas. J Comb. 21: 57-60 (2000)
1980 – 1989
- 1987
- [j1]Edoardo Ballico, Daniele C. Struppa:
Minimal degree solutions for the Bezout equation. Kybernetika 23(5): 360-364 (1987)
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-10-07 22:15 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:
