Tietoliikenne- ja tietoverkkotekniikan laitos (Comnet)

Informaatioteoria

Ryhmä tutkii diskreetin matematiikan ja informaatioteorian perusongelmia. Tärkeimmät työkalut ovat kombinatoriset algoritmit ja massiivinen laskenta.
Pelikuva

Ryhmän jäsenet

Viimeisimmät julkaisut

Infinite families of optimal systems of biangular lines related to representations of SL(2,Fq)

Mikhail Ganzhinov 2022 Journal of Combinatorial Theory. Series A

Equivalence of Butson-type Hadamard matrices

Patric R.J. Östergård 2022 JOURNAL OF ALGEBRAIC COMBINATORICS

Switching 3-edge-colorings of cubic graphs

Jan Goedgebeur, Patric R.J. Östergård 2022 Discrete Mathematics

Algorithms and complexity for counting configurations in Steiner triple systems

Daniel Heinlein, Patric R.J. Östergård 2022 Journal of Combinatorial Designs

Biangular Lines Revisited

Mikhail Ganzhinov, Ferenc Szöllősi 2021 Discrete and Computational Geometry

Generalized linkage construction for constant-dimension codes

Daniel Heinlein 2021 IEEE Transactions on Information Theory

Sparse Steiner triple systems of order 21

Janne I. Kokkala, Patric R.J. Östergård 2021 Journal of Combinatorial Designs

Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication

Roberto Assis Machado, Rafael G. L. D’Oliveira, Salim El Rouayheb, Daniel Heinlein 2021 2021 17th International Symposium Problems of Redundancy in Information and Control Systems, REDUNDANCY 2021

Quaternary complex Hadamard matrices of order 18

Patric R.J. Östergård, William T. Paavola 2021 Journal of Combinatorial Designs

Constructions of maximum few-distance sets in euclidean spaces

Patric R.J. Östergård, Ferenc Szollosi 2020 Electronic Journal of Combinatorics
More information on our research in the Research database.
Research database
  • Julkaistu:
  • Päivitetty:
Jaa
URL kopioitu