- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Deutsch
- Event
-
Veröffentlichung
- (where)
-
Bayreuth
- (who)
-
Universität Bayreuth
- (when)
-
2019
- Creator
-
Cruz, Romar dela
Kiermaier, Michael
Kurz, Sascha
Wassermann, Alfred
- URN
-
urn:nbn:de:bvb:703-epub-4569-5
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:51 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Cruz, Romar dela
- Kiermaier, Michael
- Kurz, Sascha
- Wassermann, Alfred
- Universität Bayreuth
Time of origin
- 2019
Other Objects (12)
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
Divisible minimal codes
On minimum sum representations for weighted voting games
On the maximum number of minimal codewords
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 minimum sum representations for weighted voting games
On the maximum number of minimal codewords
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 minimum sum representations for weighted voting games
On the maximum number of minimal codewords
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