default search action
Marko J. Moisio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [j14]Petr Lisonek, Marko J. Moisio:
On zeros of Kloosterman sums. Des. Codes Cryptogr. 59(1-3): 223-230 (2011)
2000 – 2009
- 2009
- [j13]Marko J. Moisio:
The divisibility modulo 24 of Kloosterman sums on GF(2m), m even. Finite Fields Their Appl. 15(2): 174-184 (2009) - [j12]Marko J. Moisio:
Explicit evaluation of some exponential sums. Finite Fields Their Appl. 15(6): 644-651 (2009) - [j11]Marko J. Moisio:
On certain values of Kloosterman sums. IEEE Trans. Inf. Theory 55(8): 3563-3564 (2009) - 2008
- [j10]Marko J. Moisio:
On the moments of Kloosterman sums and fibre products of Kloosterman curves. Finite Fields Their Appl. 14(2): 515-531 (2008) - [j9]Marko J. Moisio, Kalle Ranto:
Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients prescribed. Finite Fields Their Appl. 14(3): 798-815 (2008) - [j8]Marko J. Moisio:
On the Duals of Binary Hyper-Kloosterman Codes. SIAM J. Discret. Math. 22(1): 273-287 (2008) - 2007
- [j7]Marko J. Moisio:
On the number of rational points on some families of Fermat curves over finite fields. Finite Fields Their Appl. 13(3): 546-562 (2007) - [j6]Marko J. Moisio, Kalle Ranto:
Kloosterman sum identities and low-weight codewords in a cyclic code with two zeros. Finite Fields Their Appl. 13(4): 922-935 (2007) - [j5]Marko J. Moisio:
The Moments of a Kloosterman Sum and the Weight Distribution of a Zetterberg-Type Binary Cyclic Code. IEEE Trans. Inf. Theory 53(2): 843-847 (2007) - [j4]Cunsheng Ding
, Marko J. Moisio, Jin Yuan:
Algebraic Constructions of Optimal Frequency-Hopping Sequences. IEEE Trans. Inf. Theory 53(7): 2606-2610 (2007) - 2005
- [j3]Marko J. Moisio:
A construction of a class of maximal Kummer curves. Finite Fields Their Appl. 11(4): 667-673 (2005) - 2004
- [j2]Marko J. Moisio, Keijo O. Väänänen:
A Comparision of the Number of Rational Places of Certain Function Fields to the Hasse-Weil Bounds. Appl. Algebra Eng. Commun. Comput. 14(5): 341-359 (2004)
1990 – 1999
- 1999
- [j1]Marko J. Moisio, Keijo O. Väänänen:
Two Recursive Algorithms for Computing the Weight Distribution of Certain Irreducible Cyclic Codes. IEEE Trans. Inf. Theory 45(4): 1244-1249 (1999)
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-24 22:59 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: