Introduction to finite fields and their applications
Introduction to finite fields and their applications
Strong converse for identification via quantum channels
IEEE Transactions on Information Theory
General theory of information transfer: Updated
Discrete Applied Mathematics
On the correlation of binary sequences
Discrete Applied Mathematics
Pseudo-randomness of certain sequences of k symbols with length pq
Journal of Computer Science and Technology
Family complexity and VC-Dimension
Information Theory, Combinatorics, and Search Theory
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
We continue the investigation of Part I, keep its terminology, and also continue the numbering of sections, equations, theorems etc. Consequently we start here with Section 6. As mentioned in Section 4 we present now criteria for a triple (r,t,p) to be k–admissible. Then we consider the f–complexity (extended now to k–ary alphabets) $\Gamma_k(\mathcal{F})$ of a family $\mathcal{F}$. It serves again as a performance parameter of key spaces in cryptography. We give a lower bound for the f–complexity for a family of the type constructed in Part I. In the last sections we explain what can be said about the theoretically best families $\mathcal{F}$ with respect to their f–complexity $\Gamma_k(\mathcal{F})$. We begin with straightforward extensions of the results of [4] for k=2 to general k by using the same Covering Lemma as in [1].