EU COST Action IC1104 "Random Network Coding and Designs over GF(q)"
COST ACTION
Offizielle Homepage der Cost Action IC1104
BESCHREIBUNG
Random network coding entstand im Jahr 2008 durch eine preisgekrönte Arbeit von R. Kötter und F. Kschischang und eröffnete seither große Forschungsgebiete in der Kommunikationstechnik wie zum Beispiel dem Internet, kabellose Netzwerke sowie Cloud Computing. Es erlaubt den Informationstransport durch ein Netzwerk ohne Kenntnis der topologischen Struktur des Netzwerkes.
Analog zu der traditionellen algeraischen Kodierungstheorie sind die zwei Hauptforschungsrichtungen die Frage nach der
- Existenz und Konstruktion guter sowie optimaler Codes und dem
- effizienten Kodieren und Dekodieren der gegebenen Codes.
Die Einschränkung auf sogenannte Grassmannian codes hat sich als vorteilhaft erwiesen und führt zu der Theorie von Designs über GF(q).
Dieses Projekt wird finanziell und ideell durch die EU COST Action IC1104 "Random Network Coding and Designs over GF(q)" gefördert.
Die Arbeitsgruppe Codierungstheorie beteiligt sich in
- Working Group 1: Bounds on the Size of Network Codes
- Working Group 4: Construction of Network Codes and Grassmannian Codes
- Working Group 5: Foundational Aspects, Algebraic Methods in Random Network Coding, Distributed Storage
GEFÖRDERT DURCH
PROJEKTLEITER
- Marcus Greferath (Leiter der Cost Action IC1104)
PROJEKTLAUFZEIT
April 2012 bis April 2016
MITARBEITER DER ARBEITSGRUPPE CODIERUNGSTHEORIE IN BAYREUTH:
- Sascha Kurz (Mitglied in der Cost Action IC1104, Working Group 1 und 4)
- Alfred Wassermann (Mitglied in der Cost Action IC1104, Working Group 1, 4 und 5)
- Michael Kiermaier (Mitglied in der Cost Action IC1104, Working Group 1, 4 und 5)
- Daniel Heinlein
LITERATUR
2019
- Daniel Heinlein Thomas Honold Michael Kiermaier Sascha Kurz 2019 Generalized vector space partitions The Australasian Journal of Combinatorics 73 1 162-178 BibTeX
2018
- New LMRD bounds for constant dimension codes and improved constructions BibTeX
- Daniel Heinlein Michael Kiermaier Sascha Kurz Alfred Wassermann 2018 A subspace code of size 333 in the setting of a binary q-analog of the Fano plane BibTeX
- Marco Buratti Michael Kiermaier Sascha Kurz Anamari Nakić Alfred Wassermann 2018 q-analogs of group divisible designs BibTeX
- Thomas Honold Michael Kiermaier Sascha Kurz 2018 Johnson type bounds for mixed dimension subspace codes BibTeX
- Thomas Honold Michael Kiermaier Sascha Kurz 2018 Classification of large partial plane spreads in PG(6,2) and related combinatorial objects BibTeX
- Sascha Kurz 2018 Heden's bound on the tail of a vector space partition Discrete Mathematics 341 12 3447-3452 BibTeX
- Daniel Heinlein Sascha Kurz 2018 Binary subspace codes in small ambient spaces Advances in Mathematics of Communications 12 4 817-839 BibTeX
- Michael Kiermaier Reinhard Laue Alfred Wassermann 2018 A new series of large sets of subspace designs over the binary field Designs, Codes and Cryptography 86 2 251-268 BibTeX
- Michael Kiermaier Sascha Kurz Alfred Wassermann 2018 The order of the automorphism group of a binary q-analog of the Fano plane is at most two Designs, Codes and Cryptography 86 2 239-250 BibTeX
- Michael Braun Michael Kiermaier Alfred Wassermann 2018 Computational methods in subspace designs Network Coding and Subspace Designs Springer 213-244 BibTeX
- Michael Braun Michael Kiermaier Alfred Wassermann 2018 q-analogs of designs : Subspace designs Network Coding and Subspace Designs Springer 171-211 BibTeX
- Thomas Honold Michael Kiermaier Sascha Kurz 2018 Partial Spreads and Vector Space Partitions Network Coding and Subspace Designs Springer 131-170 BibTeX
- Daniel Heinlein Michael Kiermaier Sascha Kurz Alfred Wassermann 2018 Tables of Subspacecodes
- Daniel Heinlein Michael Kiermaier Sascha Kurz Alfred Wassermann 2018 q-Analoga von Designs, Subspace Codes und verwandte Objekte
- Alfred Wassermann Marco Buratti Sascha Kurz Anamari Nakić Michael Kiermaier 2018 q-analogs of group divisible designs
- Daniel Heinlein Thomas Honold Michael Kiermaier Sascha Kurz Alfred Wassermann 2018 Random Linear Network Coding - Wissenschaftliches Rechnen für den 5G-Standard?
- Daniel Heinlein Thomas Honold Michael Kiermaier Sascha Kurz Alfred Wassermann 2018 (Multi-)Sets of subspaces and divisible codes
- Daniel Heinlein 2018 Integer linear programming techniques for constant dimension codes and related structures Dissertation BibTeX
2017
- Daniel Heinlein Michael Kiermaier Sascha Kurz Alfred Wassermann 2017 Tables of subspace codes BibTeX
- Daniel Heinlein Thomas Honold Michael Kiermaier Sascha Kurz Alfred Wassermann 2017 Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 BibTeX
- Daniel Heinlein Michael Kiermaier Sascha Kurz Alfred Wassermann 2017 A subspace code of size 333 in the setting of a binary q-analog of the Fano plane BibTeX
- Daniel Heinlein Sascha Kurz 2017 Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound BibTeX
- Daniel Heinlein Thomas Honold Michael Kiermaier Sascha Kurz Alfred Wassermann 2017 Projective divisible binary codes BibTeX
- Sascha Kurz 2017 Packing vector spaces into vector spaces The Australasian Journal of Combinatorics 68 1 122-130 BibTeX
- Michael Braun Michael Kiermaier Axel Kohnert Reinhard Laue 2017 Large sets of subspace designs Journal of Combinatorial Theory, Series A 147 155-185 BibTeX
- Daniel Heinlein Sascha Kurz 2017 Coset Construction for Subspace Codes IEEE Transactions on Information Theory 63 12 7651-7660 BibTeX
- Sascha Kurz 2017 Improved upper bounds for partial spreads Designs, Codes and Cryptography 85 1 97-106 BibTeX
- Daniel Heinlein Thomas Honold Michael Kiermaier Sascha Kurz Alfred Wassermann 2017 Projective divisible binary codes The Tenth International Workshop on Coding and Cryptography 2017 : WCC Proceedings BibTeX
- Daniel Heinlein Sascha Kurz 2017 An upper bound for binary subspace codes of length 8, constant dimension 4 and minimum distance 6 The Tenth International Workshop on Coding and Cryptography 2017 : WCC Proceedings BibTeX
- Daniel Heinlein Sascha Kurz 2017 Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound Coding Theory and Applications : 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings Springer International Publishing 163-191 BibTeX
- Daniel Heinlein Thomas Honold Michael Kiermaier Sascha Kurz Alfred Wassermann 2017 Projective divisible binary codes
- Daniel Heinlein Thomas Honold Michael Kiermaier Sascha Kurz Alfred Wassermann 2017 Classification of optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Daniel Heinlein Sascha Kurz 2017 Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Sascha Kurz Daniel Heinlein Thomas Honold Michael Kiermaier Alfred Wassermann 2017 Upper bounds for constant dimension codes
- Daniel Heinlein Thomas Honold Michael Kiermaier Sascha Kurz Alfred Wassermann 2017 The linear programming method for partial spreads
- Daniel Heinlein Thomas Honold Michael Kiermaier Sascha Kurz Alfred Wassermann 2017 Upper bounds for partial spreads
- Daniel Heinlein Thomas Honold Michael Kiermaier Sascha Kurz Alfred Wassermann 2017 Upper bounds for partial spreads from divisible codes
- Daniel Heinlein Thomas Honold Michael Kiermaier Sascha Kurz Alfred Wassermann 2017 Classification of optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
2016
- Tables of subspace codes BibTeX
- Michael Kiermaier Sascha Kurz Alfred Wassermann 2016 The order of the automorphism group of a binary q-analog of the Fano plane is at most two BibTeX
- Thomas Honold Michael Kiermaier Sascha Kurz 2016 Constructions and Bounds for Mixed-Dimension Subspace Codes BibTeX
- Javier de la Cruz Michael Kiermaier Alfred Wassermann Wolfgang Willems 2016 Algebraic structures of MRD codes Advances in Mathematics of Communications 10 3 499-510 BibTeX
- Thomas Honold Michael Kiermaier Sascha Kurz 2016 Constructions and bounds for mixed-dimension subspace codes Advances in Mathematics of Communications 10 3 649-682 BibTeX
- Michael Braun Tuvi Etzion Patric R. J. Östergård Alexander Vardy Alfred Wassermann 2016 Existence of q-analogs of Steiner systems Forum of Mathematics, Pi 4 e7 BibTeX
- Michael Braun Michael Kiermaier Anamari Nakić 2016 On the automorphism group of a binary q-analog of the Fano plane European Journal of Combinatorics 51 443-457 BibTeX
- Thomas Honold Michael Kiermaier 2016 On putative q-analogues of the Fano plane and related combinatorial structures Dynamical Systems, Number Theory and Applications : A Festschrift in Honor of Armin Leutbecher’s 80th Birthday World Scientific 141-175 BibTeX
- Sascha Kurz 2016 Improved upper bounds for partial spreads
- Daniel Heinlein Thomas Honold Michael Kiermaier Sascha Kurz Alfred Wassermann 2016 Subspace codes
- Daniel Heinlein Sascha Kurz 2016 Coset Construction for Subspace Codes
2015
- Coset construction for subspace codes BibTeX
- Javier de la Cruz Michael Kiermaier Alfred Wassermann Wolfgang Willems 2015 Algebraic structures of MRD Codes BibTeX
- Michael Kiermaier Mario Osvin Pavčević 2015 Intersection numbers for subspace designs Journal of Combinatorial Designs 23 11 463-480 BibTeX
- Michael Kiermaier Reinhard Laue 2015 Derived and residual subspace designs Advances in Mathematics of Communications 9 1 105-115 BibTeX
- Thomas Honold Michael Kiermaier Sascha Kurz 2015 Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4 Kyureghyan, Gohar ; Mullen, Gary L. ; Pott, Alexander (Hrsg.): Topics in Finite Fields American Mathematical Society 157-176 BibTeX
- Daniel Heinlein 2015 Tables for Sizes of largest known Codes in Network Coding
- Daniel Heinlein Thomas Honold Michael Kiermaier Sascha Kurz Alfred Wassermann 2015 Towards a classification of special partial spreads and subspace codes
- Thomas Honold Michael Kiermaier Sascha Kurz 2015 Improved bounds and classification results for binary subspace codes
- Thomas Honold Michael Kiermaier Sascha Kurz 2015 ILP techniques for binary subspace codes
2015 ALCOMA 15 : Algebraic Combinatorics and Applications BibTeX
2014
- Optimal binary subspace codes of length 6, constant dimension 3 and minimum distance 4 BibTeX
- Michael Braun Axel Kohnert Patric R. J. Östergård Alfred Wassermann 2014 Large sets of t-designs over finite fields Journal of Combinatorial Theory, Series A 124 195-202 BibTeX
- Michael Braun Michael Kiermaier Anamari Nakić 2014 On the automorphism group of the binary q-analog of the Fano plane Proceedings of the 21st International Symposium on Mathematical Theory of Networks and Systems : MTNS 2014 Univ. 1402-1405 BibTeX
- Daniel Heinlein 2014 Network Coding
2013
- Existence of q-Analogs of Steiner Systems BibTeX
- Thomas Honold Michael Kiermaier 2013 The existence of maximal (q², 2)-arcs in projective Hjelmslev planes over chain rings of length 2 and odd prime characteristic Designs, Codes and Cryptography 68 1–3 105-126 BibTeX
- Michael Braun Tuvi Etzion Patric R. J. Östergård Alexander Vardy Alfred Wassermann 2013 Construction of q-analogs of Steiner systems
2012
HOMEPAGE
Eine Tabelle der Subspace Codes: http://subspacecodes.uni-bayreuth.de.