Dr.-Ing. Sven Puchinger


H.C. Ørsted Postdoctoral Fellow
Technical University of Denmark

Research Topics

This site describes my research topics and lists related publications and preprints (papers can be contained in more than one category).

Algebraic Codes

Computer Algebra

Applications

Research Topic: Rank-Metric Codes

Rank-MetricRank-metric codes are sets of matrices whose distance is measured by the rank of their difference. Among others, they can be used for error correction in channels that add an error of low rank to an input matrix. In particular, applications include network coding, code-based cryptography, distributed data storage, low-rank matrix recovery, space-time coding for MIMO systems, and digital image watermarking. Aims of research on rank-metric codes are, for instance, more efficient decoding, construction of new codes with interesting properties, as well as improving applications of the codes in various ways.

Related Publications

[J] (preprint)
Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi, Antonia Wachter-Zeh
Partial MDS Codes with Regeneration  [arxiv]
submitted to IEEE Transactions on Information Theory, 2020
[J] (preprint)
Hannes Bartz, Thomas Jerkovits, Sven Puchinger, Johan Rosenkilde
Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric  [arxiv]
in revision for IEEE Transactions on Information Theory, 2020
[J] (preprint)
Julian Renner, Sven Puchinger, Antonia Wachter-Zeh
LIGA: A Cryptosystem Based on the Hardness of Rank-Metric List and Interleaved Decoding  [arxiv]
submitted to Designs, Codes and Cryptography, 2020
[J] (preprint)
Sven Puchinger, Julian Renner, Antonia Wachter-Zeh
Decoding High-Order Interleaved Rank-Metric Codes  [arxiv]
submitted to IEEE Transactions on Information Theory, 2019
[J] Julian Renner, Alessandro Neri, Sven Puchinger
Low-Rank Parity-Check Codes over Galois Rings  [arxiv]
accepted for Designs, Codes and Cryptography, 2020
[J] Alessandro Neri, Sven Puchinger, Anna-Lena Horlemann-Trautmann
Equivalence and Characterizations of Linear Rank-Metric Codes Based on Invariants  [link] [arxiv]
Linear Algebra and Its Applications, vol. 603, pp. 418-469, 2020
[J] Sven Puchinger, Antonia Wachter-Zeh
Fast Operations on Linearized Polynomials and their Applications in Coding Theory  [link] [arxiv]
Journal of Symbolic Computation, vol. 89, pp. 194-215, 2018
[J] Sven Puchinger, Johan Rosenkilde, Wenhui Li, Vladimir Sidorenko
Row Reduction Applied to Decoding of Rank-Metric and Subspace Codes  [link] [arxiv]
Designs, Codes and Cryptography, vol. 82(1-2), pp. 389-409, 2017
[J] Sven Puchinger, Sven Müelich, David Mödinger, Johan Rosenkilde, Martin Bossert
Decoding interleaved Gabidulin codes using Alekhnovich's algorithm  [link] [arxiv]
Electronic Notes in Discrete Mathematics, 57:175-180, 2017
[J] Sven Müelich, Sven Puchinger, Martin Bossert
Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero  [link] [arxiv]
Electronic Notes in Discrete Mathematics, 57:161-166, 2017
[C] Sven Puchinger, Julian Renner, Johan Rosenkilde
Generic Decoding in the Sum-Rank Metric  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2020
[C] Julian Renner, Sven Puchinger, Antonia Wachter-Zeh, Camilla Hollanti, Ragnar Freij-Hollanti
Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Powers  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2020
[C] Julian Renner, Thomas Jerkovits, Hannes Bartz, Sven Puchinger, Pierre Loidreau, Antonia Wachter-Zeh
Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius  [link] [arxiv]
International Conference on Post-Quantum Cryptography (PQCrypto), 2020
[C] Julian Renner, Sven Puchinger, Antonia Wachter-Zeh
Interleaving Loidreau's Rank-Metric Cryptosystem  [link] [arxiv]
International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY), 2019
[C] Hannes Bartz, Thomas Jerkovits, Sven Puchinger, Johan Rosenkilde
Fast Root Finding for Interpolation-Based Decoding of Interleaved Gabidulin Codes  [link]
IEEE Information Theory Workshop (ITW), 2019
[C] Alessandro Neri, Sven Puchinger, Anna-Lena Horlemann-Trautmann
Invariants and Inequivalence of Linear Rank-Metric Codes  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2019
[C] Sven Puchinger, Julian Renner, Antonia Wachter-Zeh
Twisted Gabidulin Codes in the GPT Cryptosystem  [arxiv]
International Workshop on Algebraic and Combinatorial Coding Theory (ACCT), 2018
[C] Antonia Wachter-Zeh, Sven Puchinger, Julian Renner
Repairing the Faure-Loidreau Public-Key Cryptosystem  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2018
[C] Sven Puchinger, Johan Rosenkilde, John Sheekey
Further Generalisations of Twisted Gabidulin Codes  [arxiv]
International Workshop on Coding and Cryptography (WCC), 2017
[C] Sven Puchinger, Sven Müelich, Martin Bossert
On the Success Probability of Decoding (Partial) Unit Memory Codes  [link] [arxiv]
International Workshop on Optimal Codes and Related Topics, 2017
[C] Sven Puchinger, Sebastian Stern, Martin Bossert, Robert F.H. Fischer
Space-Time Codes Based on Rank-Metric Codes and Their Decoding  [link] [arxiv]
IEEE International Symposium on Wireless Communication Systems (ISWCS), 2016
[C] Sven Puchinger, Antonia Wachter-Zeh
Sub-Quadratic Decoding of Gabidulin Codes  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2016
[C] Sven Müelich, Sven Puchinger, David Mödinger, Martin Bossert
An Alternative Decoding Method for Gabidulin Codes in Characteristic Zero  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2016
[C] Wenhui Li, Johan S.R. Nielsen, Sven Puchinger, Vladimir Sidorenko
Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation  [link] [arxiv]
International Workshop on Coding and Cryptography (WCC), 2015
[C] Sven Puchinger, Michael Cyran, Robert F.H. Fischer, Martin Bossert, Johannes B. Huber
Error Correction for Differential Linear Network Coding in Slowly Varying Networks  [link] [arxiv]
International ITG Conference on Systems, Communications and Coding (SCC), 2015

(overlap with other topics, click here for all publications)

Research Topic: Interleaved Codes

InterleavedInterleaved codes are direct sums of codes of the same length. By assuming that errors occur in certain patterns, it is often possible to correct more errors than half the minimum distance. In the Hamming metric the assumed model is that errors occur in the same positions of the constituent codewords. Such error patterns occur, for instance, in file disagreement location, burst errors in data-storage applications, decoding outer codes of concatenated codes, certain ALOHA-like random-access schemes, decoding non-interleaved codes beyond half-the-minimum distance by power decoding, error-decoding of certain locally repairable and partial MDS codes, and code-based cryptography. In the rank metric, the constituent codewords are corrupted by low-rank matrices whose row (or column) spaces are similar. Such errors occur in network coding when lifting interleaved rank-metric codes and are used in code-based cryptosystems to reduce key sizes. Research goals for interleaved codes with various constituent codes are decoding more errors, faster decoding, as well as applications of the codes.

Related Publications

[J] (preprint)
Lukas Holzbaur, Hedongliang Liu, Alessandro Neri, Sven Puchinger, Johan Rosenkilde, Vladimir Sidorenko, Antonia Wachter-Zeh
Decoding of Interleaved Alternant Codes  [arxiv]
submitted to IEEE Transactions on Information Theory, 2020
[J] (preprint)
Hannes Bartz, Thomas Jerkovits, Sven Puchinger, Johan Rosenkilde
Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric  [arxiv]
in revision for IEEE Transactions on Information Theory, 2020
[J] (preprint)
Julian Renner, Sven Puchinger, Antonia Wachter-Zeh
LIGA: A Cryptosystem Based on the Hardness of Rank-Metric List and Interleaved Decoding  [arxiv]
submitted to Designs, Codes and Cryptography, 2020
[J] (preprint)
Sven Puchinger, Julian Renner, Antonia Wachter-Zeh
Decoding High-Order Interleaved Rank-Metric Codes  [arxiv]
submitted to IEEE Transactions on Information Theory, 2019
[J] Lukas Holzbaur, Sven Puchinger, Antonia Wachter-Zeh
Error Decoding of Locally Repairable and Partial MDS Codes  [arxiv]
accepted for IEEE Transactions on Information Theory, 2019
[J] Sven Puchinger, Johan Rosenkilde, Irene Bouw
Improved Power Decoding of Interleaved One-Point Hermitian Codes  [link] [arxiv]
Designs, Codes and Cryptography, vol. 87(2-3), pp. 689-607, 2019
[J] Sven Puchinger, Johan Rosenkilde, Wenhui Li, Vladimir Sidorenko
Row Reduction Applied to Decoding of Rank-Metric and Subspace Codes  [link] [arxiv]
Designs, Codes and Cryptography, vol. 82(1-2), pp. 389-409, 2017
[J] Sven Puchinger, Sven Müelich, David Mödinger, Johan Rosenkilde, Martin Bossert
Decoding interleaved Gabidulin codes using Alekhnovich's algorithm  [link] [arxiv]
Electronic Notes in Discrete Mathematics, 57:175-180, 2017
[C] (preprint)
Lukas Holzbaur, Hedongliang Liu, Alessandro Neri, Sven Puchinger, Johan Rosenkilde, Vladimir Sidorenko, Antonia Wachter-Zeh
Success Probability of Decoding Interleaved Alternant Codes
submitted to IEEE Information Theory Workshop (ITW), 2020
[C] Julian Renner, Sven Puchinger, Antonia Wachter-Zeh
Interleaving Loidreau's Rank-Metric Cryptosystem  [link] [arxiv]
International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY), 2019
[C] Lukas Holzbaur, Sven Puchinger, Antonia Wachter-Zeh
On Error Decoding of Locally Repairable and Partial MDS Codes  [link] [arxiv]
IEEE Information Theory Workshop (ITW), 2019
[C] Hannes Bartz, Thomas Jerkovits, Sven Puchinger, Johan Rosenkilde
Fast Root Finding for Interpolation-Based Decoding of Interleaved Gabidulin Codes  [link]
IEEE Information Theory Workshop (ITW), 2019
[C] Lukas Holzbaur, Hedongliang Liu, Sven Puchinger, Antonia Wachter-Zeh
On Decoding and Applications of Interleaved Goppa Codes  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2019
[C] Antonia Wachter-Zeh, Sven Puchinger, Julian Renner
Repairing the Faure-Loidreau Public-Key Cryptosystem  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2018
[C] Sven Puchinger, Johan Rosenkilde
Decoding of Interleaved Reed-Solomon Codes Using Improved Power Decoding  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2017

(overlap with other topics, click here for all publications)

Research Topic: Reed-Solomon & Algebraic Geometry Codes

Reed-SolomonThe family of Algebraic Geometry (AG) codes contains some of the best-known algebraic codes, including Reed-Solomon (RS) codes, which are MDS (i.e., attain the maximal possible minimum distance for a given length and dimension). The codes and their subfield subcodes have found various applications, including satellite communication, CDs, DVDs, BluRays, RAID systems, SSDs, QR codes, code-based cryptography, and distributed storage systems. Research topics range from construction of new AG or AG-like codes with good minimum distances or other interesting properties, decoding more errors, efficient en- and decoding, to applications of the codes.

Related Publications

[J] (preprint)
Lukas Holzbaur, Hedongliang Liu, Alessandro Neri, Sven Puchinger, Johan Rosenkilde, Vladimir Sidorenko, Antonia Wachter-Zeh
Decoding of Interleaved Alternant Codes  [arxiv]
submitted to IEEE Transactions on Information Theory, 2020
[J] Sven Puchinger, Johan Rosenkilde, Irene Bouw
Improved Power Decoding of Interleaved One-Point Hermitian Codes  [link] [arxiv]
Designs, Codes and Cryptography, vol. 87(2-3), pp. 689-607, 2019
[C] (preprint)
Lukas Holzbaur, Hedongliang Liu, Alessandro Neri, Sven Puchinger, Johan Rosenkilde, Vladimir Sidorenko, Antonia Wachter-Zeh
Success Probability of Decoding Interleaved Alternant Codes
submitted to IEEE Information Theory Workshop (ITW), 2020
[C] Carmen Sippel, Cornelia Ott, Sven Puchinger, Martin Bossert
Reed-Solomon Codes over Fields of Characteristic Zero  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2019
[C] Lukas Holzbaur, Hedongliang Liu, Sven Puchinger, Antonia Wachter-Zeh
On Decoding and Applications of Interleaved Goppa Codes  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2019
[C] Peter Beelen, Martin Bossert, Sven Puchinger, Johan Rosenkilde
Structural Properties of Twisted Reed-Solomon Codes with Applications to Code-Based Cryptography  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2018
[C] Sven Puchinger, Irene Bouw, Johan Rosenkilde
Improved Power Decoding of One-Point Hermitian Codes  [arxiv]
International Workshop on Coding and Cryptography (WCC), 2017
[C] Sven Puchinger, Johan Rosenkilde
Decoding of Interleaved Reed-Solomon Codes Using Improved Power Decoding  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2017
[C] Peter Beelen, Sven Puchinger, Johan Rosenkilde
Twisted Reed-Solomon Codes  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2017
[C] Mostafa H. Mohamed, Sven Puchinger, Martin Bossert
Guruswami-Sudan List Decoding for Complex Reed-Solomon Codes  [link] [arxiv]
International ITG Conference on Systems, Communications and Coding (SCC), 2017
[C] Sven Puchinger, Antonia Wachter-Zeh, Martin Bossert
Improved Decoding of Partial Unit Memory Codes Using List Decoding of Reed-Solomon Codes  [link]
International Zurich Seminar on Communications, 2014

(overlap with other topics, click here for all publications)

Research Topic: Partial Unit Memory (PUM) Codes

PartialPartial Unit Memory (PUM) codes are convolutional codes that are constructed from block codes. This construction results in a good algebraic structure of the convolutional codes and thus good distance properties. For decoding, usually a combination of decoders of the underlying block codes and a Viterbi decoder is used. The codes can be constructed in the Hamming metric, and also from rank-metric codes, in which case the PUM code is considered in the sum-rank metric. PUM codes have applications in straming scenarios, multi-shot network coding, and data storage. Research goals are new constructions and decoding of PUM codes, as well as analyzing the codes in applications.

Related Publications

[C] Sven Puchinger, Sven Müelich, Martin Bossert
On the Success Probability of Decoding (Partial) Unit Memory Codes  [link] [arxiv]
International Workshop on Optimal Codes and Related Topics, 2017
[C] Ulrich Speidel, Sven Puchinger, Martin Bossert
Constraints for Coded Tunnels Across Long Latency Bottlenecks with ARQ-based Congestion Control  [link]
IEEE International Symposium on Information Theory (ISIT), 2017
[C] Yuval Cassuto, Evyatar Hemo, Sven Puchinger, Martin Bossert
Multi-Block Interleaved Codes for Local and Global Read Access  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2017
[C] Sven Puchinger, Michael Cyran, Robert F.H. Fischer, Martin Bossert, Johannes B. Huber
Error Correction for Differential Linear Network Coding in Slowly Varying Networks  [link] [arxiv]
International ITG Conference on Systems, Communications and Coding (SCC), 2015
[C] Sven Puchinger, Antonia Wachter-Zeh, Martin Bossert
Improved Decoding of Partial Unit Memory Codes Using List Decoding of Reed-Solomon Codes  [link]
International Zurich Seminar on Communications, 2014

(overlap with other topics, click here for all publications)

Research Topic: Computer Algebra for Fast Decoding

ComputerComputer algebra studies algorithms for computations with mathematical objects, typically using exact computation (in contrast to floating point arithmetic). In coding theory, encoding and decoding of codes are algorithms that are often based on computations with polynomials, matrices, and polynomial matrices over finite fields or other fields that allow exact computation (such as number fields). In order to efficiently en- and decode codes, it is essential to know efficient algorithms to perform these kinds of computations. Current decoding-related research areas in computer algebra are, for instance, operations with multi-variate polynomials (algebraic-geometry codes) and the non-commutative skew or linearized polynomials (rank-metric codes).

Related Publications

[J] (preprint)
Hannes Bartz, Thomas Jerkovits, Sven Puchinger, Johan Rosenkilde
Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric  [arxiv]
in revision for IEEE Transactions on Information Theory, 2020
[J] Sven Puchinger, Antonia Wachter-Zeh
Fast Operations on Linearized Polynomials and their Applications in Coding Theory  [link] [arxiv]
Journal of Symbolic Computation, vol. 89, pp. 194-215, 2018
[J] Sven Puchinger, Johan Rosenkilde, Wenhui Li, Vladimir Sidorenko
Row Reduction Applied to Decoding of Rank-Metric and Subspace Codes  [link] [arxiv]
Designs, Codes and Cryptography, vol. 82(1-2), pp. 389-409, 2017
[J] Sven Puchinger, Sven Müelich, David Mödinger, Johan Rosenkilde, Martin Bossert
Decoding interleaved Gabidulin codes using Alekhnovich's algorithm  [link] [arxiv]
Electronic Notes in Discrete Mathematics, 57:175-180, 2017
[C] Hannes Bartz, Thomas Jerkovits, Sven Puchinger, Johan Rosenkilde
Fast Root Finding for Interpolation-Based Decoding of Interleaved Gabidulin Codes  [link]
IEEE Information Theory Workshop (ITW), 2019
[C] Sven Puchinger, Antonia Wachter-Zeh
Sub-Quadratic Decoding of Gabidulin Codes  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2016
[C] Wenhui Li, Johan S.R. Nielsen, Sven Puchinger, Vladimir Sidorenko
Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation  [link] [arxiv]
International Workshop on Coding and Cryptography (WCC), 2015

(overlap with other topics, click here for all publications)

Research Topic: Code-Based Cryptography

Code-BasedPublic-key cryptosystems are an essential part of many data transmission systems and protocols. Currently-used systems based on number-theoretic problems are however threatened by the possibility that large-scale quantum computers might be built in near future - Shor's algorithm is able to solve these seemingly hard problems in polynomial time on such a computer. Hence, there is a need for post-quantum secure cryptosystems. Code-based cryptosystems, in particular the McEliece cryptosystem and its variants, are public-key cryptosystems based on error-correcting codes, and the oldest ones of the few discussed post-quantum systems. Important aims of research are the reduction of key and ciphertext sizes, efficient decryption, security analysis of existing schemes, and finding suitable code-based signature schemes.

Related Publications

[J] (preprint)
Georg Maringer, Sven Puchinger, Antonia Wachter-Zeh
Higher Rates and Information-Theoretic Analysis for the RLWE Channel  [arxiv]
submitted to IEEE Journal on Selected Areas in Information Theory, 2020
[J] (preprint)
Julian Renner, Sven Puchinger, Antonia Wachter-Zeh
LIGA: A Cryptosystem Based on the Hardness of Rank-Metric List and Interleaved Decoding  [arxiv]
submitted to Designs, Codes and Cryptography, 2020
[C] (preprint)
Georg Maringer, Sven Puchinger, Antonia Wachter-Zeh
Higher Rates and Information-Theoretic Analysis for the RLWE Channel
submitted to IEEE Information Theory Workshop (ITW), 2020
[C] Julian Renner, Thomas Jerkovits, Hannes Bartz, Sven Puchinger, Pierre Loidreau, Antonia Wachter-Zeh
Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius  [link] [arxiv]
International Conference on Post-Quantum Cryptography (PQCrypto), 2020
[C] Julian Renner, Sven Puchinger, Antonia Wachter-Zeh
Interleaving Loidreau's Rank-Metric Cryptosystem  [link] [arxiv]
International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY), 2019
[C] Lukas Holzbaur, Hedongliang Liu, Sven Puchinger, Antonia Wachter-Zeh
On Decoding and Applications of Interleaved Goppa Codes  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2019
[C] Sven Puchinger, Julian Renner, Antonia Wachter-Zeh
Twisted Gabidulin Codes in the GPT Cryptosystem  [arxiv]
International Workshop on Algebraic and Combinatorial Coding Theory (ACCT), 2018
[C] Antonia Wachter-Zeh, Sven Puchinger, Julian Renner
Repairing the Faure-Loidreau Public-Key Cryptosystem  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2018
[C] Peter Beelen, Martin Bossert, Sven Puchinger, Johan Rosenkilde
Structural Properties of Twisted Reed-Solomon Codes with Applications to Code-Based Cryptography  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2018
[C] Sven Puchinger, Sven Müelich, Karim Ishak, Martin Bossert
Code-Based Cryptosystems Using Generalized Concatenated Codes  [link] [arxiv]
Ilias~S. Kotsireas and Edgar Martínez-Moro, editors, Springer Proceedings in Mathematics \& Statistics: Applications of Computer Algebra: Kalamata, Greece, July 20-23 2015, volume 198, pages 397-423. Springer International Publishing, 2017

(overlap with other topics, click here for all publications)

Research Topic: Physical Unclonable Functions (PUFs)

PhysicalPhysical Unclonable Functions (PUFs) are hardware primitives that utilize manufacturing variations to generate random but reproducible sequences. Unclonable refers to the hardness of manufacturing two PUFs with a similar output. The output sequences can be used for key generation in cryptographic applications. They can also be reproduced by the same PUF on demand, making (expensive) secure non-volatile key storage obsolete. This reproduction process, however, is noisy due to measurement uncertainty, aging, and temperature or voltage variations, and hence, error-correcting codes must be used to increase the regeneration reliability. Stronger error correction may allow the extraction and regeneration of longer random sequences from the same hardware. Research areas include the study of, and code design for, various atypical channel models occuring in the regeneration process. Moreover, efficient and secure implementations of decoders are necessary for the practicality of the proposed coding schemes.

Related Publications

[C] Sven Müelich, Sven Puchinger, Veniamin Stukalov, Martin Bossert
A Channel Model and Soft-Decision Helper Data Algorithms for ROPUFs  [link]
International ITG Conference on Systems, Communications and Coding (SCC), 2019
[C] Sven Müelich, Sven Puchinger, Martin Bossert
Constructing an LDPC Code Containing a Given Vector  [arxiv]
International Workshop on Algebraic and Combinatorial Coding Theory (ACCT), 2018
[C] Sven Müelich, Sven Puchinger, Martin Bossert
Using Convolutional Codes for Key Extraction in SRAM Physical Unclonable Functions  [arxiv]
Trustworthy Manufacturing and Utilization of Secure Devices (TRUDEVICE) Workshop, 2018
[C] Sven Puchinger, Sven Müelich, Antonia Wachter-Zeh, Martin Bossert
Timing Attack Resilient Decoding Algorithms for Physical Unclonable Functions  [link] [arxiv]
International ITG Conference on Systems, Communications and Coding (SCC), 2017
[C] Matthias Hiller, Ludwig Kürzinger, Georg Sigl, Sven Müelich, Sven Puchinger, Martin Bossert
Low-Area Reed Decoding in a Generalized Concatenated Code Construction for PUFs  [link]
IEEE Computer Society Annual Symposium on VLSI (ISVLSI), 2015
[C] Sven Puchinger, Sven Müelich, Martin Bossert, Matthias Hiller, Georg Sigl
On Error Correction for Physical Unclonable Functions  [link] [arxiv]
International ITG Conference on Systems, Communications and Coding (SCC), 2015
[C] Sven Müelich, Sven Puchinger, Martin Bossert, Matthias Hiller, Georg Sigl
Error Correction for Physical Unclonable Functions Using Generalized Concatenated Codes  [link] [arxiv]
International Workshop on Algebraic and Combinatorial Coding Theory (ACCT), 2014

(overlap with other topics, click here for all publications)

Research Topic: Coding for Storage Systems

CodingCoding is an important ingredient of any machine-readable data storage system due to write, read and other types of errors, as well as failures of parts of the system. Research in this area include analyzing media-specific error models and coding constraints, as well as proposing coding solutions for various storage media allowing to increase the amount of stored data or reliability. Among many others, this includes flash memories, which are used in commercial products like USB sticks or SSDs, and also potential future storage media like synthesized DNA. Another aspect of research are distributed data storage systems, where failures occur in the system and coding solutions aim not only at increasing the reliability of the system, but also at minimizing the cost (e.g., amount of transmitted data) for reparing the failed part of the system.

Related Publications

[J] (preprint)
Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi, Antonia Wachter-Zeh
Partial MDS Codes with Regeneration  [arxiv]
submitted to IEEE Transactions on Information Theory, 2020
[J] Lukas Holzbaur, Sven Puchinger, Antonia Wachter-Zeh
Error Decoding of Locally Repairable and Partial MDS Codes  [arxiv]
accepted for IEEE Transactions on Information Theory, 2019
[C] Haider Al Kim, Sven Puchinger, Antonia Wachter-Zeh
Bounds and Code Constructions for Partially Defect Memory Cells  [arxiv]
International Workshop on Algebraic and Combinatorial Coding Theory (ACCT), 2020
[C] Andreas Lenz, Lorenz Welter, Sven Puchinger
Achievable Rates of Concatenated Codes in DNA Storage under Substitution Errors  [pdf] [arxiv]
accepted at International Symposium on Information Theory and Its Applications (ISITA), 2020
[C] Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi, Antonia Wachter-Zeh
Partial MDS Codes with Local Regeneration  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2020
[C] Haider Al Kim, Sven Puchinger, Antonia Wachter-Zeh
Error Correction for Partially Stuck Memory Cells  [link] [arxiv]
International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY), 2019
[C] Lukas Holzbaur, Sven Puchinger, Antonia Wachter-Zeh
On Error Decoding of Locally Repairable and Partial MDS Codes  [link] [arxiv]
IEEE Information Theory Workshop (ITW), 2019
[C] Yuval Cassuto, Evyatar Hemo, Sven Puchinger, Martin Bossert
Multi-Block Interleaved Codes for Local and Global Read Access  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2017

(overlap with other topics, click here for all publications)

Research Topic: Network Coding

NetworkNetwork coding is a method to increase the throughput and eavesdropping resilience of data transmission through a network. The idea is to combine packets at intermediate nodes instead of only forwarding them, e.g., using linear combinations of packets (which are vectors in this case). Coding theory can be applied to network coding in various ways. For instance, it can be used to increase the reliability of the system in case of errors or erasures within the network. It can also be used to construct the functions that combine packets at the nodes such that the transmitted packets can be reconstructed at the destination nodes.

Related Publications

[J] (preprint)
Hedongliang Liu, Hengjia Wei, Sven Puchinger, Antonia Wachter-Zeh, Moshe Schwartz
On the Gap between Scalar and Vector Solutions of Generalized Combination Networks  [arxiv]
in revision for IEEE Transactions on Information Theory, 2020
[J] (preprint)
Hannes Bartz, Thomas Jerkovits, Sven Puchinger, Johan Rosenkilde
Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric  [arxiv]
in revision for IEEE Transactions on Information Theory, 2020
[C] Hedongliang Liu, Hengjia Wei, Sven Puchinger, Antonia Wachter-Zeh, Moshe Schwartz
On the Gap between Scalar and Vector Solutions of Generalized Combination Networks  [link] [arxiv]
IEEE International Symposium on Information Theory (ISIT), 2020
[C] Sven Puchinger, Michael Cyran, Robert F.H. Fischer, Martin Bossert, Johannes B. Huber
Error Correction for Differential Linear Network Coding in Slowly Varying Networks  [link] [arxiv]
International ITG Conference on Systems, Communications and Coding (SCC), 2015

(overlap with other topics, click here for all publications)