6 citations · 18 across the 11 of their papers we have counts for
13 papers
PERIDOT Codes: Replacing Identifiers, Sequence Numbers and Nonces with Permutations
Florian Euchner, Christian Senger
Identifiers and sequence numbers make up a large part of the protocol overhead in certain low-power wide-area networks. The requirement for cryptographic nonces in authentication a…
A Linear Algebraic Approach to Subfield Subcodes of GRS Codes
Christian Senger, Rohit Bohara
The problem of finding subfield subcodes of generalized Reed-Solomon (GRS) codes (i.e., alternant codes) is considered. A pure linear algebraic approach is taken in order to derive…
Prefactor Reduction of the Guruswami-Sudan Interpolation Step
Christian Senger
The concept of prefactors is considered in order to decrease the complexity of the Guruswami-Sudan interpolation step for generalized Reed-Solomon codes. It is shown that the well-…
Re-Encoding Techniques for Interpolation-Based Decoding of Reed-Solomon Codes
Christian Senger
We consider interpolation-based decoding of Reed-Solomon codes using the Guruswami-Sudan algorithm (GSA) and investigate the effects of two modification techniques for received vec…
Some Comments on the Strong Simplex Conjecture
Dejan E. Lazich, Christian Senger, Martin Bossert
In the disproof of the Strong Simplex Conjecture presented in [Steiner, 1994], a counterexample signal set was found that has higher average probability of correct optimal decoding…
Optimal Threshold-Based Multi-Trial Error/Erasure Decoding with the Guruswami-Sudan Algorithm
Christian Senger, Vladimir R. Sidorenko, Martin Bossert +1
Traditionally, multi-trial error/erasure decoding of Reed-Solomon (RS) codes is based on Bounded Minimum Distance (BMD) decoders with an erasure option. Such decoders have error/er…
Adaptive Single-Trial Error/Erasure Decoding of Reed-Solomon Codes
Christian Senger, Vladimir R. Sidorenko, Steffen Schober +2
Algebraic decoding algorithms are commonly applied for the decoding of Reed-Solomon codes. Their main advantages are low computational complexity and predictable decoding capabilit…
A Link between Guruswami--Sudan's List--Decoding and Decoding of Interleaved Reed--Solomon Codes
Alexander Zeh, Christian Senger
The Welch--Berlekamp approach for Reed--Solomon (RS) codes forms a bridge between classical syndrome--based decoding algorithms and interpolation--based list--decoding procedures f…
Adaptive Single-Trial Error/Erasure Decoding for Binary Codes
Christian Senger, Vladimir R. Sidorenko, Steffen Schober +2
We investigate adaptive single-trial error/erasure decoding of binary codes whose decoder is able to correct e errors and t erasures if le+t<=d-1. Thereby, d is the minimum Hamming…
Optimal Thresholds for GMD Decoding with (L+1)/L-extended Bounded Distance Decoders
Christian Senger, Vladimir R. Sidorenko, Martin Bossert +1
We investigate threshold-based multi-trial decoding of concatenated codes with an inner Maximum-Likelihood decoder and an outer error/erasure (L+1)/L-extended Bounded Distance deco…
End-to-End Algebraic Network Coding for Wireless TCP/IP Networks
Christian Senger, Steffen Schober, Tong Mao +1
The Transmission Control Protocol (TCP) was designed to provide reliable transport services in wired networks. In such networks, packet losses mainly occur due to congestion. Hence…
On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel
Christian Senger, Vladimir Sidorenko, Victor Zyablov
We consider the Additive White Gaussian Noise channel with Binary Phase Shift Keying modulation. Our aim is to enable an algebraic hard decision Bounded Minimum Distance decoder fo…
Decoding Generalized Concatenated Codes Using Interleaved Reed-Solomon Codes
Christian Senger, Vladimir Sidorenko, Martin Bossert +1
Generalized Concatenated codes are a code construction consisting of a number of outer codes whose code symbols are protected by an inner code. As outer codes, we assume the most f…