![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Eleonora Guerrini
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Matteo Abbondati
, Eleonora Guerrini
, Romain Lebreton
:
Decoding Simultaneous Rational Evaluation Codes. ISSAC 2024: 153-161 - [i13]Giulia Cavicchioni, Eleonora Guerrini, Alessio Meneghetti:
A class of locally recoverable codes over finite chain rings. CoRR abs/2401.05286 (2024) - 2023
- [j6]Eleonora Guerrini, Kamel Lairedj, Romain Lebreton, Ilaria Zappatore:
Simultaneous Rational Function Reconstruction with errors: Handling multiplicities and poles. J. Symb. Comput. 116: 345-364 (2023) - [c8]Matteo Abbondati, Antoine Afflatet, Eleonora Guerrini, Romain Lebreton:
Probabilistic Analysis of LLL-based Decoder of Interleaved Chinese Remainder Codes. ITW 2023: 424-429 - 2021
- [c7]Eleonora Guerrini, Romain Lebreton, Ilaria Zappatore:
Polynomial Linear System Solving with Random Errors: New Bounds and Early Termination Technique. ISSAC 2021: 171-178 - [i12]Eleonora Guerrini, Romain Lebreton, Ilaria Zappatore:
Polynomial Linear System Solving with Random Errors: new bounds and early termination technique. CoRR abs/2102.04182 (2021) - 2020
- [c6]Eleonora Guerrini, Romain Lebreton
, Ilaria Zappatore:
On the uniqueness of simultaneous rational function reconstruction. ISSAC 2020: 226-233 - [i11]Eleonora Guerrini, Romain Lebreton, Ilaria Zappatore:
On the Uniqueness of Simultaneous Rational Function Reconstruction. CoRR abs/2002.08748 (2020) - [i10]Eleonora Guerrini, Romain Lebreton, Ilaria Zappatore:
Enhancing simultaneous rational function recovery: adaptive error correction capability and new bounds for applications. CoRR abs/2003.01793 (2020)
2010 – 2019
- 2019
- [c5]Eleonora Guerrini, Romain Lebreton
, Ilaria Zappatore:
Polynomial Linear System Solving with Errors by Simultaneous Polynomial Reconstruction of Interleaved Reed-Solomon Codes. ISIT 2019: 1542-1546 - [i9]Eleonora Guerrini, Romain Lebreton, Ilaria Zappatore:
Polynomial Linear System Solving with Errors by Simultaneous Polynomial Reconstruction of Interleaved Reed-Solomon Codes. CoRR abs/1907.04401 (2019) - 2018
- [j5]Eleonora Guerrini, Laurent Imbert
, Théo Winterhalter
:
Randomized Mixed-Radix Scalar Multiplication. IEEE Trans. Computers 67(3): 418-431 (2018) - 2016
- [j4]Eleonora Guerrini, Alessio Meneghetti
, Massimiliano Sala
:
On Optimal Nonlinear Systematic Codes. IEEE Trans. Inf. Theory 62(6): 3103-3112 (2016) - [i8]Eleonora Guerrini, Laurent Imbert, Théo Winterhalter:
Randomized Mixed-Radix Scalar Multiplication. IACR Cryptol. ePrint Arch. 2016: 1022 (2016) - 2015
- [i7]Emanuele Bellini, Eleonora Guerrini, Alessio Meneghetti, Massimiliano Sala:
On the Griesmer bound for nonlinear codes. CoRR abs/1502.07379 (2015) - [i6]Eleonora Guerrini, Alessio Meneghetti, Massimiliano Sala:
On optimal nonlinear systematic codes. CoRR abs/1506.03227 (2015) - [i5]Eleonora Guerrini, Laurent Imbert, Théo Winterhalter:
Randomizing Scalar Multiplication Using Exact Covering Systems of Congruences. IACR Cryptol. ePrint Arch. 2015: 475 (2015) - 2014
- [j3]Emanuele Bellini
, Eleonora Guerrini, Massimiliano Sala
:
Some Bounds on the Size of Codes. IEEE Trans. Inf. Theory 60(3): 1475-1480 (2014) - [c4]Julien Devigne, Eleonora Guerrini, Fabien Laguillaumie:
Proxy Re-Encryption Scheme Supporting a Selection of Delegatees. AFRICACRYPT 2014: 13-30 - 2012
- [i4]Eleonora Guerrini, Emanuele Bellini, Massimiliano Sala:
A bound on the size of linear codes and systematic codes. CoRR abs/1206.6006 (2012) - 2011
- [j2]Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov:
Extremal graphs for the identifying code problem. Eur. J. Comb. 32(4): 628-638 (2011) - [c3]Eleonora Guerrini, Daniele Veronesi:
Bit Loading Algorithm Based on a Probabilistic Approach for HomePlug AV. GLOBECOM 2011: 1-6 - 2010
- [i3]Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov:
Extremal graphs for the identifying code problem. CoRR abs/1004.5230 (2010)
2000 – 2009
- 2009
- [j1]Eleonora Guerrini, Lorenzo Guerrieri, Daniele Veronesi, Paola Bisaglia, Roberto Cappelletti:
LLR-based Bit-loading Algorithm and its Applications to HomePlug AV over OPERA Power-line Channels with Impulsive Noise. J. Commun. 4(7): 454-462 (2009) - [c2]Gabriele Dell'Amico, Eleonora Guerrini, Raffaele Riva:
Inter-Packet Channel Estimation in OFDM Systems. GLOBECOM 2009: 1-6 - [p2]Eleonora Guerrini, Anna Rimoldi:
FGLM-Like Decoding: from Fitzpatrick's Approach to Recent Developments. Gröbner Bases, Coding, and Cryptography 2009: 197-218 - [p1]Eleonora Guerrini, Emmanuela Orsini
, Ilaria Simonetti:
Gröbner Bases for the Distance Distribution of Systematic Codes. Gröbner Bases, Coding, and Cryptography 2009: 367-372 - [i2]Eleonora Guerrini, Massimiliano Sala:
A bound on the size of linear codes. CoRR abs/0902.1634 (2009) - [i1]Eleonora Guerrini, Emmanuela Orsini, Massimiliano Sala:
Computing the distance distribution of systematic non-linear codes. CoRR abs/0909.1626 (2009) - 2007
- [c1]Lorenzo Guerrieri, Eleonora Guerrini, Daniele Veronesi, Paola Bisaglia, Gabriele Dell'Amico:
LLR-Based Bit-Loading Algorithm for the Turbo Coded HomePlug AV. GLOBECOM 2007: 140-145
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-07-20 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint