Numbers, Information and Complexity is a collection of about 50 articles in honour of Rudolf Ahlswede. His main areas of research are represented in the three sections, `Numbers and Combinations', `Information Theory (Channels and Networks, Combinatorial and Algebraic Coding, Cryptology, with the related fields Data Compression, Entropy Theory, Symbolic Dynamics, Probability and Statistics)', and `Complexity'. Special attention was paid to the interplay between the fields. Surveys on topics of current interest are included as well as new research results. The book features surveys on Combinatorics about topics such as intersection theorems, which are not yet covered in textbooks, several contributions by leading experts in data compression, and relations to Natural Sciences are discussed.Remark: The condition (5) in Theorem 2 is a sufficient but not a necessary Condition for the existance of a q-SIC. This follows from the next example. Eaa#39; ample: Let q = 3, m = 2 and n = 4. The following code has distance 2. The correspondinganbsp;...
|Title||:||Numbers, Information and Complexity|
|Author||:||Ingo Althöfer, Ning Cai, Gunter Dueck, Levon H. Khachatrian, Marcus Pinsker, G. Sarkozy, Ingo Wegener, Zhen Zhang|
|Publisher||:||Springer Science & Business Media - 2013-04-17|