We stand with Ukraine  

Michael Huber

Affiliations:
  • University of Tübingen, Wilhelm Schickard Institute for Computer Science, Germany


According to our database1, Michael Huber authored at least 20 papers between 2001 and 2014.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
Absorbing Set Analysis and Design of LDPC Codes from Transversal Designs over the AWGN Channel.
[BibTeX]
[DOI]
Alexander Gruner
,
Michael Huber
CoRR, 2014

2013
Efficient Majority-Logic Decoding of Short-Length Reed-Muller Codes at Information Positions.
[BibTeX]
[DOI]
Peter Hauck
,
Michael Huber
,
Juliane Bertram
,
Dennis Brauchle
,
Sebastian Ziesche
IEEE Trans. Commun., 2013

Low-Density Parity-Check Codes from Transversal Designs with Improved Stopping Set Distributions.
[BibTeX]
[DOI]
Alexander Gruner
,
Michael Huber
IEEE Trans. Commun., 2013

An Improved Majority-Logic Decoder Offering Massively Parallel Decoding for Real-Time Control in Embedded Systems.
[BibTeX]
[DOI]
Juliane Bertram
,
Peter Hauck
,
Michael Huber
IEEE Trans. Commun., 2013

Visualizing dimensionality reduction of systems biology data.
[BibTeX]
[DOI]
Andreas M. Lehrmann
,
Michael Huber
,
Aydin Can Polatkan
,
Albert Pritzkau
,
Kay Nieselt
Data Min. Knowl. Discov., 2013

Efficient Two-Stage Group Testing Algorithms for Genetic Screening.
[BibTeX]
[DOI]
Michael Huber
Algorithmica, 2013

2012
New Combinatorial Construction Techniques for Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes.
[BibTeX]
[DOI]
Alexander Gruner
,
Michael Huber
IEEE Trans. Commun., 2012

Perfect secrecy systems immune to spoofing attacks.
[BibTeX]
[DOI]
Michael Huber
Int. J. Inf. Sec., 2012

2011
Computational complexity of reconstruction and isomorphism testing for designs and line graphs.
[BibTeX]
[DOI]
Michael Huber
J. Comb. Theory, Ser. A, 2011

Information Theoretic Authentication and Secrecy Codes in the Splitting Model
[BibTeX]
[DOI]
Michael Huber
CoRR, 2011

Efficient Two-Stage Group Testing Algorithms for DNA Screening
[BibTeX]
[DOI]
Michael Huber
CoRR, 2011

2010
Almost simple groups with socle L<sub>n</sub>(q) acting on Steiner quadruple systems.
[BibTeX]
[DOI]
Michael Huber
J. Comb. Theory, Ser. A, 2010

On the Cameron-Praeger conjecture.
[BibTeX]
[DOI]
Michael Huber
J. Comb. Theory, Ser. A, 2010

Combinatorial Designs for Authentication and Secrecy Codes.
[BibTeX]
[DOI]
Michael Huber
Found. Trends Commun. Inf. Theory, 2010

On the existence of block-transitive combinatorial designs.
[BibTeX]
[DOI]
Michael Huber
Discret. Math. Theor. Comput. Sci., 2010

Block-transitive designs in affine spaces.
[BibTeX]
[DOI]
Michael Huber
Des. Codes Cryptogr., 2010

Combinatorial bounds and characterizations of splitting authentication codes.
[BibTeX]
[DOI]
Michael Huber
Cryptogr. Commun., 2010

2009
Constructing Optimal Authentication Codes with Perfect Multi-fold Secrecy
[BibTeX]
[DOI]
Michael Huber
CoRR, 2009

Authentication and secrecy codes for equiprobable source probability distributions.
[BibTeX]
[DOI]
Michael Huber
Proceedings of the IEEE International Symposium on Information Theory, 2009

2001
Classification of Flag-Transitive Steiner Quadruple Systems.
[BibTeX]
[DOI]
Michael Huber
J. Comb. Theory, Ser. A, 2001


  Loading...