- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Deutsch
- Ereignis
-
Veröffentlichung
- (wo)
-
Bayreuth
- (wer)
-
Universität Bayreuth
- (wann)
-
2019
- Urheber
-
Cruz, Romar dela
Kiermaier, Michael
Kurz, Sascha
Wassermann, Alfred
- URN
-
urn:nbn:de:bvb:703-epub-4569-5
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:51 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Cruz, Romar dela
- Kiermaier, Michael
- Kurz, Sascha
- Wassermann, Alfred
- Universität Bayreuth
Entstanden
- 2019
Ähnliche Objekte (12)
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
Divisible minimal codes
On the maximum number of minimal codewords
On minimum sum representations for weighted voting games
Correction to "On minimum sum representations for weighted voting games"
Classification of 8-divisible binary linear codes with minimum distance 24
On the minimum number of minimal codewords
Bounds for the diameter of the weight polytope
Non-projective two-weight codes
Capacity of generalized diamond networks
Lifted codes and the multilevel construction for constant dimension codes
A note on the linkage construction for constant dimension codes
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
Divisible minimal codes
On the maximum number of minimal codewords
On minimum sum representations for weighted voting games
Correction to "On minimum sum representations for weighted voting games"
Classification of 8-divisible binary linear codes with minimum distance 24
On the minimum number of minimal codewords
Bounds for the diameter of the weight polytope
Non-projective two-weight codes
Capacity of generalized diamond networks
Lifted codes and the multilevel construction for constant dimension codes
A note on the linkage construction for constant dimension codes
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
Divisible minimal codes
On the maximum number of minimal codewords
On minimum sum representations for weighted voting games
Correction to "On minimum sum representations for weighted voting games"
Classification of 8-divisible binary linear codes with minimum distance 24
On the minimum number of minimal codewords
Bounds for the diameter of the weight polytope
Non-projective two-weight codes
Capacity of generalized diamond networks
Lifted codes and the multilevel construction for constant dimension codes