Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Huber 0002
Person information
- affiliation: University of Tübingen, Wilhelm Schickard Institute for Computer Science, Germany
Other persons with the same name
- Michael Huber — disambiguation page
- Michael Huber 0001 — ARITHNEA GmbH, Taufkirchen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j15]Michael Huber:
Efficient Two-Stage Group Testing Algorithms for Genetic Screening. Algorithmica 67(3): 355-367 (2013)- [j14]Andreas M. Lehrmann, Michael Huber, Aydin Can Polatkan, Albert Pritzkau, Kay Nieselt
:
Visualizing dimensionality reduction of systems biology data. Data Min. Knowl. Discov. 27(1): 146-165 (2013) - [j13]Peter Hauck, Michael Huber, Juliane Bertram, Dennis Brauchle, Sebastian Ziesche:
Efficient Majority-Logic Decoding of Short-Length Reed-Muller Codes at Information Positions. IEEE Trans. Commun. 61(3): 930-938 (2013) - [j12]Alexander Gruner, Michael Huber:
Low-Density Parity-Check Codes from Transversal Designs with Improved Stopping Set Distributions. IEEE Trans. Commun. 61(6): 2190-2200 (2013) - [j11]Juliane Bertram, Peter Hauck, Michael Huber:
An Improved Majority-Logic Decoder Offering Massively Parallel Decoding for Real-Time Control in Embedded Systems. IEEE Trans. Commun. 61(12): 4808-4815 (2013) - 2012
- [j10]Michael Huber:
Perfect secrecy systems immune to spoofing attacks. Int. J. Inf. Sec. 11(4): 281-289 (2012) - [j9]Alexander Gruner, Michael Huber:
New Combinatorial Construction Techniques for Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes. IEEE Trans. Commun. 60(9): 2387-2395 (2012) - 2011
- [j8]Michael Huber:
Computational complexity of reconstruction and isomorphism testing for designs and line graphs. J. Comb. Theory, Ser. A 118(2): 341-349 (2011) - 2010
- [j7]Michael Huber:
Combinatorial bounds and characterizations of splitting authentication codes. Cryptogr. Commun. 2(2): 173-185 (2010) - [j6]Michael Huber:
Block-transitive designs in affine spaces. Des. Codes Cryptogr. 55(2-3): 235-242 (2010) - [j5]Michael Huber:
On the existence of block-transitive combinatorial designs. Discret. Math. Theor. Comput. Sci. 12(1): 122-132 (2010) - [j4]Michael Huber:
Combinatorial Designs for Authentication and Secrecy Codes. Found. Trends Commun. Inf. Theory 5(6): 581-675 (2010) - [j3]Michael Huber:
On the Cameron-Praeger conjecture. J. Comb. Theory, Ser. A 117(2): 196-203 (2010) - [j2]Michael Huber:
Almost simple groups with socle Ln(q) acting on Steiner quadruple systems. J. Comb. Theory, Ser. A 117(7): 1004-1007 (2010) - 2001
- [j1]Michael Huber:
Classification of Flag-Transitive Steiner Quadruple Systems. J. Comb. Theory, Ser. A 94(1): 180-190 (2001)
Conference and Workshop Papers
- 2009
- [c1]Michael Huber:
Authentication and secrecy codes for equiprobable source probability distributions. ISIT 2009: 1105-1109
Informal and Other Publications
- 2014
- [i13]Alexander Gruner, Michael Huber:
Absorbing Set Analysis and Design of LDPC Codes from Transversal Designs over the AWGN Channel. CoRR abs/1403.4405 (2014) - 2013
- [i12]Michael Huber:
Efficient Two-Stage Group Testing Algorithms for Genetic Screening. CoRR abs/1306.4664 (2013) - [i11]Alexander Gruner, Michael Huber:
Low-Density Parity-Check Codes From Transversal Designs With Improved Stopping Set Distributions. CoRR abs/1306.5111 (2013) - [i10]Juliane Bertram, Peter Hauck, Michael Huber:
An Improved Majority-Logic Decoder Offering Massively Parallel Decoding for Real-Time Control in Embedded Systems. CoRR abs/1310.4349 (2013) - 2012
- [i9]Alexander Gruner, Michael Huber:
New Combinatorial Construction Techniques for Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes. CoRR abs/1203.6566 (2012) - [i8]Michael Huber:
Perfect Secrecy Systems Immune to Spoofing Attacks. CoRR abs/1205.4874 (2012) - [i7]Peter Hauck, Michael Huber, Juliane Bertram, Dennis Brauchle, Sebastian Ziesche:
Efficient Majority-Logic Decoding of Short-Length Reed--Muller Codes at Information Positions. CoRR abs/1212.1139 (2012) - 2011
- [i6]Michael Huber:
Efficient Two-Stage Group Testing Algorithms for DNA Screening. CoRR abs/1106.3680 (2011) - [i5]Michael Huber:
Information Theoretic Authentication and Secrecy Codes in the Splitting Model. CoRR abs/1112.0038 (2011) - 2010
- [i4]Michael Huber:
Combinatorial Bounds and Characterizations of Splitting Authentication Codes. CoRR abs/1001.3780 (2010) - [i3]Michael Huber:
Computational complexity of reconstruction and isomorphism testing for designs and line graphs. CoRR abs/1006.5892 (2010) - 2009
- [i2]Michael Huber:
Authentication and Secrecy Codes for Equiprobable Source Probability Distributions. CoRR abs/0904.0109 (2009) - [i1]Michael Huber:
Constructing Optimal Authentication Codes with Perfect Multi-fold Secrecy. CoRR abs/0912.0597 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
