29 citations · 211 across the 26 of their papers we have counts for
26 papers
How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
Michael Kiran Huber
We study the Short Path Packing problem which asks, given a graph , integers and , and vertices and , whether there exist pairwise internally vertex-disjoin…
Absorbing Set Analysis and Design of LDPC Codes from Transversal Designs over the AWGN Channel
Alexander Gruner, Michael Huber
In this paper we construct low-density parity-check (LDPC) codes from transversal designs with low error-floors over the additive white Gaussian noise (AWGN) channel. The construct…
An Improved Majority-Logic Decoder Offering Massively Parallel Decoding for Real-Time Control in Embedded Systems
Juliane Bertram, Peter Hauck, Michael Huber
We propose an easy-to-implement hard-decision majority-logic decoding algorithm for Reed-Muller codes RM(r,m) with m >= 3, m/2 >= r >= 1. The presented algorithm outperforms the be…
Low-Density Parity-Check Codes From Transversal Designs With Improved Stopping Set Distributions
Alexander Gruner, Michael Huber
This paper examines the construction of low-density parity-check (LDPC) codes from transversal designs based on sets of mutually orthogonal Latin squares (MOLS). By transferring th…
Efficient Two-Stage Group Testing Algorithms for Genetic Screening
Michael Huber
Efficient two-stage group testing algorithms that are particularly suited for rapid and less-expensive DNA library screening and other large scale biological group testing efforts…
Efficient Majority-Logic Decoding of Short-Length Reed--Muller Codes at Information Positions
Peter Hauck, Michael Huber, Juliane Bertram +2
Short-length Reed--Muller codes under majority-logic decoding are of particular importance for efficient hardware implementations in real-time and embedded systems. This paper sign…