We determine the minimum possible column multiplicity of even, doubly-, ...
We consider the problem of error correction in a network where the error...
We exhibit the hidden beauty of weighted voting and voting power by appl...
Subspace codes are the q-analog of binary block codes in the Hamming
met...
A linear code over 𝔽_q with the Hamming metric is called
Δ-divisible if ...
Many real-world voting systems consist of voters that occur in just two
...
A basic problem for constant dimension codes is to determine the maximum...
The proof of the non-existence of Griesmer [104, 4, 82]_5-codes is just ...
The Public Good index is a power index for simple games introduced by Ho...
We classify 8-divisible binary linear codes with minimum distance 24 and...
One of the main problems in random network coding is to compute good low...
A major concern in cloud/edge storage systems is serving a large number ...
Minimal codewords have applications in decoding linear codes and in
cryp...
We show that no projective 16-divisible binary linear code of length 131...
Binary yes-no decisions in a legislative committee or a shareholder meet...
The remoteness from a simple game to a weighted game can be measured by ...
Constant dimension codes are e.g. used for error correction and detectio...
We present algorithms for classification of linear codes over finite fie...
The Shapley-Shubik index is a specialization of the Shapley value and is...
Service rate is an important, recently introduced, performance metric
as...
In this work private information retrieval (PIR) codes are studied. In a...
A committee's decisions on more than two alternatives much depend on the...
We present an algorithm for the classification of linear codes over fini...
In the context of constant–dimension subspace codes, an important proble...
The Grassmannian G_q(n,k) is the set of all k-dimensional
subspaces of t...
We improve on the lower bound of the maximum number of planes in
PG(8,q)...
The Shapley-Shubik index was designed to evaluate the power distribution...
Constant dimension codes are used for error control in random linear net...
The minimum distance of all binary linear codes with dimension at most e...
It is shown that there does not exist a binary projective triply-even co...
We discuss possible criteria that may qualify or disqualify power indice...
The Grassmannian G_q(n,k) is the set of all k-dimensional
subspaces of ...
A simple game (N,v) is given by a set N of n players and a partition
of ...
It is well known that the Penrose-Banzhaf index of a weighted game can d...
A weighted game or a threshold function in general admits different weig...
The Shapley value is commonly illustrated by roll call votes in which pl...
A simple game (N,v) is given by a set N of n players and a partition of
...
Codes in finite projective spaces equipped with the subspace distance ha...
Decisions in a shareholder meeting or a legislative committee are often
...
Given a system where the real-valued states of the agents are aggregated...
Determining the power distribution of the members of a shareholder meeti...
Weighted committee games generalize n-player simple voting games to m>
3...