default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArne Winterhof
- > Home > Persons > Arne Winterhof
Publications
- 2019
[j72]Igor E. Shparlinski
, Arne Winterhof:
Codes correcting restricted errors. Des. Codes Cryptogr. 87(4): 855-863 (2019)- 2018
- [i3]Igor E. Shparlinski, Arne Winterhof:
Codes correcting restricted errors. CoRR abs/1811.03375 (2018) - 2014
- [j51]Zhixiong Chen, Igor E. Shparlinski, Arne Winterhof:
Covering Sets for Limited-Magnitude Errors. IEEE Trans. Inf. Theory 60(9): 5315-5321 (2014) - 2013
- [j50]Igor E. Shparlinski, Arne Winterhof:
Distribution of values of polynomial Fermat quotients. Finite Fields Their Appl. 19(1): 93-104 (2013) - [i2]Zhixiong Chen, Igor E. Shparlinski, Arne Winterhof:
Covering sets for limited-magnitude errors. CoRR abs/1310.0120 (2013) - 2010
- [j44]Alina Ostafe, Igor E. Shparlinski, Arne Winterhof:
On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences. Adv. Math. Commun. 4(3): 369-379 (2010) - 2007
- [j34]Igor E. Shparlinski, Arne Winterhof:
Quantum period reconstruction of approximate sequences. Inf. Process. Lett. 103(6): 211-215 (2007) - 2006
- [j32]Igor E. Shparlinski, Arne Winterhof:
On the nonlinearity of linear recurrence sequences. Appl. Math. Lett. 19(4): 340-344 (2006) - [j25]Moubariz Z. Garaev, Florian Luca, Igor E. Shparlinski, Arne Winterhof:
On the Lower Bound of the Linear Complexity Over BBF_p of Sidelnikov Sequences. IEEE Trans. Inf. Theory 52(7): 3299-3304 (2006) - [c9]Igor E. Shparlinski, Arne Winterhof:
Constructions of Approximately Mutually Unbiased Bases. LATIN 2006: 793-799 - [c8]Igor E. Shparlinski, Arne Winterhof:
On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences. SETA 2006: 295-303 - 2005
- [j23]Igor E. Shparlinski, Arne Winterhof:
Noisy interpolation of sparse polynomials in finite fields. Appl. Algebra Eng. Commun. Comput. 16(5): 307-317 (2005) - [j21]Igor E. Shparlinski, Arne Winterhof:
On the linear complexity of bounded integer sequences over different moduli. Inf. Process. Lett. 96(5): 175-177 (2005) - [j19]Igor E. Shparlinski, Arne Winterhof:
A hidden number problem in small subgroups. Math. Comput. 74(252): 2073-2080 (2005) - 2004
- [c5]Igor E. Shparlinski, Arne Winterhof:
A Nonuniform Algorithm for the Hidden Number Problem in Subgroups. Public Key Cryptography 2004: 416-424 - 2003
- [j12]Jaime Gutierrez, Igor E. Shparlinski, Arne Winterhof:
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators. IEEE Trans. Inf. Theory 49(1): 60-64 (2003) - [i1]Igor E. Shparlinski, Arne Winterhof:
Hidden Number Problem in Small Subgroups. IACR Cryptol. ePrint Arch. 2003: 49 (2003) - 2002
- [j8]Bruno Codenotti, Igor E. Shparlinski, Arne Winterhof:
On the hardness of approximating the permanent of structured matrices. Comput. Complex. 11(3-4): 158-170 (2002)
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-08-03 21:12 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:
