default search action
Anne-Maria Ernvall-Hytönen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j9]Anne-Maria Ernvall-Hytönen, Neea Palojärvi
:
Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis. Math. Comput. 91(335): 1317-1365 (2022)
2010 – 2019
- 2019
- [j8]Anne-Maria Ernvall-Hytönen, Tapani Matala-aho, Louna Seppälä:
Euler's Divergent Series in Arithmetic Progressions. J. Integer Seq. 22(2): 19.2.2 (2019) - 2018
- [j7]Anne-Maria Ernvall-Hytönen, Esa V. Vesalainen:
On the Secrecy Gain of ℓ-Modular Lattices. SIAM J. Discret. Math. 32(2): 1441-1457 (2018) - 2017
- [i7]Esa V. Vesalainen, Anne-Maria Ernvall-Hytönen:
On the secrecy gain of $\ell$-modular lattices. CoRR abs/1708.09239 (2017) - 2016
- [j6]Alina Bucur, Anne-Maria Ernvall-Hytönen, Almasa Odzak
On a Li-type criterion for zero-free regions of certain Dirichlet series with real coefficients. LMS J. Comput. Math. 19(1): 259-280 (2016) - [j5]Anne-Maria Ernvall-Hytönen, B. A. Sethuraman
Counterexample to the Generalized Belfiore-Solé Secrecy Function Conjecture for l-Modular Lattices. IEEE Trans. Inf. Theory 62(8): 4514-4522 (2016) - 2015
- [j4]David A. Karpuk, Anne-Maria Ernvall-Hytönen, Camilla Hollanti, Emanuele Viterbo
Probability estimates for fading and wiretap channels from ideal class zeta functions. Adv. Math. Commun. 9(4): 391-413 (2015) - [c2]Anne-Maria Ernvall-Hytönen, B. A. Sethuraman:
Counterexample to the generalized belfiore-solé secrecy function conjecture for l-modular lattices. ISIT 2015: 2466-2469 - 2014
- [j3]Anne-Maria Ernvall-Hytönen:
Some Results Related to the Conjecture by Belfiore and Solé. IEEE Trans. Inf. Theory 60(5): 2805-2812 (2014) - [i6]Anne-Maria Ernvall-Hytönen, B. A. Sethuraman:
Counterexample to the $l$-modular Belfiore-Solé Conjecture. CoRR abs/1409.3188 (2014) - [i5]David A. Karpuk, Anne-Maria Ernvall-Hytönen, Camilla Hollanti, Emanuele Viterbo:
Probability Estimates for Fading and Wiretap Channels from Ideal Class Zeta Functions. CoRR abs/1412.6946 (2014) - 2013
- [i4]Anne-Maria Ernvall-Hytönen:
Some results related to the conjecture by Belfiore and Solé. CoRR abs/1303.7460 (2013) - 2012
- [j2]Anne-Maria Ernvall-Hytönen:
On a Conjecture by Belfiore and Solé on Some Lattices. IEEE Trans. Inf. Theory 58(9): 5950-5955 (2012) - [i3]Anne-Maria Ernvall-Hytönen:
A short note on the kissing number of the lattice in Gaussian wiretap coding. CoRR abs/1209.3573 (2012) - 2011
- [c1]Anne-Maria Ernvall-Hytönen, Camilla Hollanti:
On the eavesdropper's correct decision in Gaussian and fading wiretap channels using lattice codes. ITW 2011: 210-214 - [i2]Anne-Maria Ernvall-Hytönen:
On a conjecture by Belfiore and Solé on some lattices. CoRR abs/1104.3739 (2011) - [i1]Anne-Maria Ernvall-Hytönen, Camilla Hollanti:
On the Eavesdropper's Correct Decision in Gaussian and Fading Wiretap Channels Using Lattice Codes. CoRR abs/1106.2756 (2011)
2000 – 2009
- 2008
- [j1]Lenny Jones, Rachel Keller, Toni Ernvall, Anne-Maria Ernvall-Hytönen:
A Special Prime: 11235. Am. Math. Mon. 115(7): 666 (2008)
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-04-25 05:41 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: