52 citations · 121 across the 5 of their papers we have counts for
5 papers
Multiple-Bases Belief-Propagation Decoding of High-Density Cyclic Codes
Thorsten Hehn, Johannes B. Huber, Olgica Milenkovic +1
We introduce a new method for decoding short and moderate length linear block codes with dense parity-check matrix representations of cyclic form, termed multiple-bases belief-prop…
MBBP for improved iterative channel decoding in 802.16e WiMAX systems
Thorsten Hehn, Johannes B. Huber, Stefan Laendner
We propose the application of multiple-bases belief-propagation, an optimized iterative decoding method, to a set of rate-1/2 LDPC codes from the IEEE 802.16e WiMAX standard. The p…
Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes
Thorsten Hehn, Olgica Milenkovic, Stefan Laendner +1
We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the trade-off between performance and complexity of iterative decoding for the b…
Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block Codes
Thorsten Hehn, Olgica Milenkovic, Stefan Laendner +1
We investigate the stopping redundancy hierarchy of linear block codes and its connection to permutation decoding techniques. An element in the ordered list of stopping redundancy…
The Trapping Redundancy of Linear Block Codes
Stefan Laendner, Thorsten Hehn, Olgica Milenkovic +1
We generalize the notion of the stopping redundancy in order to study the smallest size of a trapping set in Tanner graphs of linear block codes. In this context, we introduce the…