- Sprache
-
Englisch
- Identifier
-
1315702290
- Beteiligte Personen und Organisationen
-
Kurz, Sascha
- DOI
-
10.25593/open-fau-264
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.02.2024, 11:10 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.
Objekttyp
- Monografie
Beteiligte
- Kurz, Sascha
Ähnliche Objekte (12)
Classification of 8-divisible binary linear codes with minimum distance 24
Bounds for flag codes
Bounds for flag codes
Constructions and bounds for subspace codes
Generalized LMRD code bounds for constant dimension codes
Bounds for the diameter of the weight polytope
Bounds for the diameter of the weight polytope
On minimum sum representations for weighted voting games
Correction to "On minimum sum representations for weighted voting games"
Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes
Trifferent codes with small lengths
Designing codes for storage allocation
Classification of 8-divisible binary linear codes with minimum distance 24
Bounds for flag codes
Bounds for flag codes
Constructions and bounds for subspace codes
Generalized LMRD code bounds for constant dimension codes
Bounds for the diameter of the weight polytope
Bounds for the diameter of the weight polytope
On minimum sum representations for weighted voting games
Correction to "On minimum sum representations for weighted voting games"
Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes
Trifferent codes with small lengths
Designing codes for storage allocation
Classification of 8-divisible binary linear codes with minimum distance 24
Bounds for flag codes
Bounds for flag codes
Constructions and bounds for subspace codes
Generalized LMRD code bounds for constant dimension codes
Bounds for the diameter of the weight polytope
Bounds for the diameter of the weight polytope
On minimum sum representations for weighted voting games
Correction to "On minimum sum representations for weighted voting games"
Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes
Trifferent codes with small lengths