default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSven Müelich
- > Home > Persons > Sven Müelich
Publications
- 2020
[c5]Sven Müelich, Chirag Sudarshan, Christian Weis, Martin Bossert, Robert F. H. Fischer, Norbert Wehn:
Multi-Valued Physical Unclonable Functions based on Dynamic Random Access Memory. MEMSYS 2020: 126-136- 2019
- [c3]Sven Müelich, Sebastian Bitzer, Chirag Sudarshan, Christian Weis, Norbert Wehn
, Martin Bossert, Robert F. H. Fischer:
Channel Models for Physical Unclonable Functions based on DRAM Retention Measurements. REDUNDANCY 2019: 149-154 - 2017
- [j2]Sven Müelich, Sven Puchinger, Martin Bossert:
Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero. Electron. Notes Discret. Math. 57: 161-166 (2017) - [j1]Sven Puchinger, Sven Müelich, David Mödinger, Johan Rosenkilde, Martin Bossert:
Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm. Electron. Notes Discret. Math. 57: 175-180 (2017) - [i11]Sven Müelich, Sven Puchinger, Martin Bossert:
Security Considerations of a New Helper Data Scheme for Physical Unclonable Functions. CoRR abs/1703.07973 (2017) - [i10]Sven Müelich, Martin Bossert:
Using Convolutional Codes for Key Extraction in Physical Unclonable Functions. CoRR abs/1704.01306 (2017) - [i9]Sven Puchinger, Sven Müelich, Martin Bossert:
On the Success Probability of Decoding (Partial) Unit Memory Codes. CoRR abs/1705.08652 (2017) - 2016
- [c2]Sven Müelich, Sven Puchinger, David Mödinger, Martin Bossert:
An alternative decoding method for Gabidulin codes in characteristic zero. ISIT 2016: 2549-2553 - [i8]Sven Müelich, Sven Puchinger, David Mödinger, Martin Bossert:
An Alternative Decoding Method for Gabidulin Codes in Characteristic Zero. CoRR abs/1601.05205 (2016) - [i7]Sven Müelich, Sven Puchinger, Martin Bossert:
Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero. CoRR abs/1604.04397 (2016) - [i6]Sven Puchinger, Sven Müelich, David Mödinger, Johan Sebastian Rosenkilde Nielsen, Martin Bossert:
Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm. CoRR abs/1604.05899 (2016) - [i5]Sven Müelich, Martin Bossert:
A New Error Correction Scheme for Physical Unclonable Functions. CoRR abs/1611.01960 (2016) - [i4]Sven Puchinger, Sven Müelich, Antonia Wachter-Zeh, Martin Bossert:
Timing Attack Resilient Decoding Algorithms for Physical Unclonable Functions. CoRR abs/1611.07702 (2016) - 2015
- [c1]Matthias Hiller, Ludwig Kurzinger, Georg Sigl, Sven Müelich, Sven Puchinger, Martin Bossert:
Low-Area Reed Decoding in a Generalized Concatenated Code Construction for PUFs. ISVLSI 2015: 143-148 - [i3]Sven Puchinger, Sven Müelich, Martin Bossert, Matthias Hiller, Georg Sigl:
On Error Correction for Physical Unclonable Functions. CoRR abs/1501.06698 (2015) - [i2]Sven Puchinger, Sven Müelich, Karim Ishak, Martin Bossert:
Code-Based Cryptosystems Using Generalized Concatenated Codes. CoRR abs/1511.08413 (2015) - 2014
- [i1]Sven Müelich, Sven Puchinger, Martin Bossert, Matthias Hiller, Georg Sigl:
Error Correction for Physical Unclonable Functions Using Generalized Concatenated Codes. CoRR abs/1407.8034 (2014)
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:49 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:
