Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Event: Veröffentlichung

(where): Bayreuth

(who): Universität Bayreuth

(when): 2023

Creator: Kurz, Sascha

DOI: 10.15495/EPub_UBT_00007255

URN: urn:nbn:de:bvb:703-epub-7255-3

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 10:47 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Kurz, Sascha
Universität Bayreuth

Time of origin

2023

Other Objects (12)

Hochschulschrift

Konstruktion und Eigenschaften ganzzahliger Punktmengen

Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound

Are weighted games sufficiently good for binary voting?

Upper bounds for partial spreads

Counting polyominoes with minimum perimeter

Are weighted games sufficiently good for binary voting?

Which criteria qualify power indices for applications? : A comment to "The story of the poor Public Good index"

On the characteristic of integral point sets in E_hnm

Integral point sets over finite fields

The power of the largest player

Enumeration of integral tetrahedra

Convex hulls of polyominoes

Hochschulschrift

Konstruktion und Eigenschaften ganzzahliger Punktmengen

Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound

Are weighted games sufficiently good for binary voting?

Upper bounds for partial spreads

Counting polyominoes with minimum perimeter

Are weighted games sufficiently good for binary voting?

Which criteria qualify power indices for applications? : A comment to "The story of the poor Public Good index"

On the characteristic of integral point sets in E_hnm

Integral point sets over finite fields

The power of the largest player

Enumeration of integral tetrahedra

Convex hulls of polyominoes

Hochschulschrift

Konstruktion und Eigenschaften ganzzahliger Punktmengen

Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound

Are weighted games sufficiently good for binary voting?

Upper bounds for partial spreads

Counting polyominoes with minimum perimeter

Are weighted games sufficiently good for binary voting?

Which criteria qualify power indices for applications? : A comment to "The story of the poor Public Good index"

On the characteristic of integral point sets in E_hnm

Integral point sets over finite fields

The power of the largest player

Enumeration of integral tetrahedra

Convex hulls of polyominoes

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes

Object Details

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Konstruktion und Eigenschaften ganzzahliger Punktmengen

Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound

Are weighted games sufficiently good for binary voting?

Upper bounds for partial spreads

Counting polyominoes with minimum perimeter

Are weighted games sufficiently good for binary voting?

Which criteria qualify power indices for applications? : A comment to "The story of the poor Public Good index"

On the characteristic of integral point sets in E_hnm

Integral point sets over finite fields

The power of the largest player

Enumeration of integral tetrahedra

Convex hulls of polyominoes

Konstruktion und Eigenschaften ganzzahliger Punktmengen

Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound

Are weighted games sufficiently good for binary voting?

Upper bounds for partial spreads

Counting polyominoes with minimum perimeter

Are weighted games sufficiently good for binary voting?

Which criteria qualify power indices for applications? : A comment to "The story of the poor Public Good index"

On the characteristic of integral point sets in E_hnm

Integral point sets over finite fields

The power of the largest player

Enumeration of integral tetrahedra

Convex hulls of polyominoes

Konstruktion und Eigenschaften ganzzahliger Punktmengen

Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound

Are weighted games sufficiently good for binary voting?

Upper bounds for partial spreads

Counting polyominoes with minimum perimeter

Are weighted games sufficiently good for binary voting?

Which criteria qualify power indices for applications? : A comment to "The story of the poor Public Good index"

On the characteristic of integral point sets in E_hnm

Integral point sets over finite fields

The power of the largest player

Enumeration of integral tetrahedra

Convex hulls of polyominoes

Related objects

Reset password