32 citations · 174 across the 33 of their papers we have counts for
6 papers · 2 filters
Algebraic Soft Decoding of Reed-Solomon Codes Using Module Minimization
Jiongyue Xing, Li Chen, Martin Bossert
The interpolation based algebraic decoding for Reed-Solomon (RS) codes can correct errors beyond half of the code's minimum Hamming distance. Using soft information, the algebraic…
Code Constructions based on Reed-Solomon Codes
Michael Schelling, Martin Bossert
Reed--Solomon codes are a well--studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size of the underlying field $\mathb…
On the Success Probability of Decoding (Partial) Unit Memory Codes
Sven Puchinger, Sven Müelich, Martin Bossert
In this paper, we derive analytic expressions for the success probability of decoding (Partial) Unit Memory codes in memoryless channels. An applications of this result is that the…
Using Convolutional Codes for Key Extraction in SRAM Physical Unclonable Functions
Sven Müelich, Sven Puchinger, Martin Bossert
Physical Unclonable Functions (PUFs) exploit variations in the manufacturing process to derive bit sequences from integrated circuits, which can be used as secure cryptographic key…
Constructing an LDPC Code Containing a Given Vector
Sven Müelich, Sven Puchinger, Martin Bossert
The coding problem considered in this work is to construct a linear code of given length and dimension such that a given binary vector $\mathbf{r} \in \math…
Multi-Block Interleaved Codes for Local and Global Read Access
Yuval Cassuto, Evyatar Hemo, Sven Puchinger +1
We define multi-block interleaved codes as codes that allow reading information from either a small sub-block or from a larger full block. The former offers faster access, while th…