Forschung

Die Forschungsarbeiten des Lehrstuhls beziehen sich auf die Anwendung von Methoden der diskreten Mathematik und Algebra in der Informatik und auf grundlegende Fragen der Gruppentheorie und Designtheorie.

Im Einzelnen werden zur Zeit folgende Themen bearbeitet:
  • Monoide, formale Sprachen und Komplexität
  • Struktur faktorisierter endlicher Gruppen
  • Designs und Automorphismengruppen
  • Public-Key-Systeme und Secret Sharing Schemes in der Kryptologie
  • Authentication Codes
  • Effiziente Decodierung fehlerkorrigierender Codes

Aktuelle Publikationen

  • Gallego, M.P., Hauck, P., Perez-Ramos, M.D. (2016):
    2-Engel relations between subgroups.
    Journal of Algebra 447, 31-55, 2016.
  • Brewster, B., Hauck, P., Wilcox, E. (2014):
    Quasi-antichain Chermak-Delgado lattices in finite groups.
    Archiv Math. 103, 301-311, 2014.
  • Brewster, B., Hauck, P., Wilcox, E. (2014):
    Groups whose Chermak-Delgado lattice is a chain.
    Journal of Group Theory 17, 253-265, 2014.
  • Bertram, J., Hauck, P., Huber, M. (2013):
    An improved majority-logic-decoder offering massively parallel decoding for real-time control in embedded systems.
    IEEE Transactions on Communications 61, 4808-4815, 2013.
  • Gruner A.; Huber, M. (2013):
    Low-density parity-check codes from transversal designs with improved stopping set distributions.
    IEEE Transactions on Communications 61, 2190-2200, 2013.
  • Huber, M. (2013):
    Efficient two-stage group testing algorithms for genetic screening.
    Algorithmica 67, 355-367, 2013.
  • Hauck, P.; Huber, M.; Bertram, J.; Brauchle, D.; Ziesche, S. (2013):
    Efficient Majority-Logic Decoding of Short-Length Reed-Muller Codes at Information Positions.
    IEEE Transactions on Communications 61(3), 930-938, 2013.
  • Lehrmann, A.; Huber, M.; Polatkan, A.C.; Pritzkau, A.; Nieselt, K. (2013):
    Visualizing dimensionality reduction of systems biology data.
    Data Mining and Knowledge Discovery 27, 146-165, 2013.
  • Huber, M. (2012):
    Perfect secrecy systems immune to spoofing attacks.
    International Journal of Information Security 11, 281-289, 2012.
  • Gruner, A.; Huber, M. (2012):
    New combinatorial construction techniques for low-density parity-check codes and systematic repeat-accumulate codes.
    IEEE Transactions on Communications 60, 2387-2395, 2012.
  • Hauck, P.; Zahursky, V.N. (2012):
    A characterization of dominant local Fitting classes.
    Journal of Algebra 358, 27-32, 2012
  • Huber, M. (2012):
    Information theoretic authentication and secrecy codes in the splitting model.
    Proc. IEEE International Zürich Seminar on Communications (IZS) 2012, 87-90.
  • Behle, C.; Krebs, A.; Reifferscheid, S.:
    Typed Monoids - An Eilenberg-like Theorem for non regular Languages.
    CAI 2011, Hagenberg/Linz, Austria, 97-114.
  • Ulrich, A., Holz, R., Hauck, P., Carle, G. (2011):
    Investigating the OpenPGP Web of Trust.
    Computer Security - ESORICS 2011, LNCS 6879, 489-507.
  • Huber, M. (2011):
    Efficient two-stage group testing algorithms for DNA screening.
    ICALP 2011 GT, Zürich.
  • Gallego, M.P.; Hauck, P.; Pérez-Ramos, M.D. (2011):
    Saturated formations and products of connected subgroups.
    Journal of Algebra 333, 105-119, 2011.
  • Huber, M. (2011):
    Computational complexity of reconstruction and isomorphism testing for designs and line graphs.
    Journal of Combinatorial Theory, Series A. 118:341-349.
  • Brewster, B.; Evan, J.; Hauck, P.; Reifferscheid, S. (2010):
    Subgroups of a direct product of groups satisfying the strong Frattini argument.
    Communications in Algebra, 38:3993-4004.
  • Huber, M. (2010):
    Combinatorial bounds and characterizations of splitting authentication codes.
    Cryptography and Communications, 2:173-185.
  • Huber, M. (2010):
    Combinatorial Designs for Authentication and Secrecy Codes.
    Monograph, Foundations and Trends in Communications and Information Theory, Now Publishers, Boston, Delft.
  • Huber, M. (2010):
    Almost simple groups with socle Ln(q) acting on Steiner quadruple systems.
    Journal of Combinatorial Theory, Series A. 117:1004-1007.
  • Huber, M. (2010):
    On the existence of block-transitive combinatorial designs.
    Discrete Mathematics & Theoretical Computer Science (DMTCS), 2010, 12:123-132
  • Huber, M. (2010):
    Constructing optimal authentication codes with perfect multi-fold secrecy.
    Proc. IEEE International Zürich Seminar on Communications (IZS) 2010, 86-89.
  • Huber, M. (2010):
    Block-transitive designs in affine spaces.
    Designs, Codes and Cryptography, 55:235-242.
  • Huber, M. (2010):
    Coding Theory and Algebraic Combinatorics.
    Selected Topics in Information and Coding Theory, I. Woungang et al. (eds.),. World Scientific, Singapore, 2010, 121-158.
  • Huber, M. (2010):
    On the Cameron-Praeger conjecture.
    Journal of Combinatorial Theory, Series A. 117:196-203, 2010
  • Behle, C.; Krebs, A.; Reifferscheid, S.:
    Regular Languages definable by Majority Quantifiers with two Variables
    Accepted for DLT 2009, Stuttgart
  • Behle, C.; Krebs, A.; Reifferscheid, S.:
    Non-Solvable Groups are not in FO+MOD+MAJ2[REG]
    Accepted for LATA 2009 (April 2-8, 2009 - Tarragona, Spain)
  • Huber, M. (2009):
    Authentication and secrecy codes for equiprobable source probability distributions.
    Proc. IEEE Intl. Symp. Inform. Theory (ISIT) 2009, 1105-1109.
  • Bochtler, J. (2009):
    Radicals in mutually permutable products of finite groups.
    J. Algebra 321, 353-360.
  • Huber, M. (2009):
    Flag-transitive Steiner Designs.
    Monograph, Frontiers in Mathematics, Birkhäuser, Basel, Berlin, Boston.
  • Korsten, A. (2008):
    Cryptanalysis of MOR and Discrete Logarithms in Inner Automorphism Groups.
    WEWoRC 2007, LNCS 4945, 78-89.
  • Beiter, M. (2008):
    Combiner Driven Management Models and Their Applications.
    WEWoRC 2007, LNCS 4945, 114-126.
  • Gallego, M. P.; Hauck, P.; Pérez-Ramos, M. D. (2008):
    On 2-generated subgroups and products of groups.
    J. Group Theory 11, 851-867.
  • Holz, R.; Niedermayer, H.; Hauck, P.; Carle, G. (2008):
    Trust-Rated Authentication for Domain-Structured Distributed Systems.
    EuroPKI 2008, LNCS 5057, 74-88.
  • Gallego, M. P.; Hauck, P.; Pérez-Ramos, M. D. (2008):
    Soluble products of connected subgroups.
    Rev. Mat. Iberoamericana 24, 433-461.
  • Huber, M. (2008):
    Steiner t-designs for large t.
    LNCS 5393, 18–26
  • Krebs, A.; Lange, K.-J.; Reifferscheid, S. (2007):
    Characterizing TC0 in Terms of Infinite Groups
    Theory Comput. Systems 40, 303-325
  • Bochtler, J.; Hauck, P. (2007):
    Mutually permutable subgroups and Fitting classes.
    Arch. Math. 88, 385-388.
  • Huber, M. (2007):
    A census of highly symmetric combinatorial designs.
    Journal of Algebraic Combinatorics, 26:453–476
  • Huber, M. (2007):
    The classification of flag-transitive Steiner 4-designs.
    Journal of Algebraic Combinatorics, 26:183–207