Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Ereignis
-
Veröffentlichung
- (wo)
-
Bayreuth
- (wer)
-
Universität Bayreuth
- (wann)
-
2023
- Urheber
-
Kurz, Sascha
- DOI
-
10.15495/EPub_UBT_00007255
- URN
-
urn:nbn:de:bvb:703-epub-7255-3
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:55 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
- Kurz, Sascha
- Universität Bayreuth
Entstanden
- 2023
Ähnliche Objekte (12)
Capacity of generalized diamond networks
Bounds for the diameter of the weight polytope
Divisible minimal codes
Non-projective two-weight codes
Lifted codes and the multilevel construction for constant dimension codes
A note on the linkage construction for constant dimension codes
On minimum sum representations for weighted voting games
The [46,9,20]₂ code is unique
LinCode - computer classification of linear codes
Correction to "On minimum sum representations for weighted voting games"
A note on the growth of the dimension in complete simple games
Vector space partitions of GF(2)^8
Capacity of generalized diamond networks
Bounds for the diameter of the weight polytope
Divisible minimal codes
Non-projective two-weight codes
Lifted codes and the multilevel construction for constant dimension codes
A note on the linkage construction for constant dimension codes
On minimum sum representations for weighted voting games
The [46,9,20]₂ code is unique
LinCode - computer classification of linear codes
Correction to "On minimum sum representations for weighted voting games"
A note on the growth of the dimension in complete simple games
Vector space partitions of GF(2)^8
Capacity of generalized diamond networks
Bounds for the diameter of the weight polytope
Divisible minimal codes
Non-projective two-weight codes
Lifted codes and the multilevel construction for constant dimension codes
A note on the linkage construction for constant dimension codes
On minimum sum representations for weighted voting games
The [46,9,20]₂ code is unique
LinCode - computer classification of linear codes
Correction to "On minimum sum representations for weighted voting games"
A note on the growth of the dimension in complete simple games