Narrow your search

Library

KU Leuven (8)

Odisee (8)

Thomas More Kempen (8)

Thomas More Mechelen (8)

UCLL (8)

ULB (8)

ULiège (8)

VIVES (8)

UGent (4)

KBC (2)

More...

Resource type

book (8)


Language

English (8)


Year
From To Submit

2021 (1)

2019 (1)

2018 (1)

2016 (1)

2015 (1)

More...
Listing 1 - 8 of 8
Sort by

Book
Lectures on Advances in Combinatorics
Authors: ---
ISBN: 3540786023 3540786015 Year: 2008 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The main focus of these lectures is basis extremal problems and inequalities – two sides of the same coin. Additionally they prepare well for approaches and methods useful and applicable in a broader mathematical context. Highlights of the book include a solution to the famous 4m-conjecture of Erdös/Ko/Rado 1938, one of the oldest problems in combinatorial extremal theory, an answer to a question of Erdös (1962) in combinatorial number theory "What is the maximal cardinality of a set of numbers smaller than n with no k+1 of its members pair wise relatively prime?", and the discovery that the AD-inequality implies more general and sharper number theoretical inequalities than for instance Behrend's inequality. Several concepts and problems in the book arise in response to or by rephrasing questions from information theory, computer science, statistical physics. The interdisciplinary character creates an atmosphere rich of incentives for new discoveries and lends Ars Combinatoria a special status in mathematics. At the end of each chapter, problems are presented in addition to exercises and sometimes conjectures that can open a reader’s eyes to new interconnections.

General theory of information transfer and combinatorics
Authors: ---
ISBN: 9783540462446 3540462449 3540462457 Year: 2006 Publisher: Berlin ; New York : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Information theory. --- Combinatorial analysis. --- Théorie de l'information --- Analyse combinatoire --- Ahlswede, Rudolf, --- Combinatorial analysis --- Information theory --- Computer Science --- Algebra --- Mathematics --- Engineering & Applied Sciences --- Physical Sciences & Mathematics --- Communication theory --- Combinatorics --- Computer science. --- Computer communication systems. --- Data structures (Computer science). --- Algorithms. --- Numerical analysis. --- Computer science --- Computer Science. --- Computer Communication Networks. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Numeric Computing. --- Data Structures, Cryptology and Information Theory. --- Mathematics. --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Mathematical analysis --- Algorism --- Arithmetic --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Informatics --- Science --- Foundations --- Distributed processing --- Communication --- Cybernetics --- Computer software. --- Computational complexity. --- Electronic data processing. --- Data structures (Computer scienc. --- Data Structures and Information Theory. --- Complexity, Computational --- Machine theory --- Software, Computer --- Computer systems --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Automation --- Computer science—Mathematics. --- Computer networks. --- Discrete mathematics. --- Numerical Analysis. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis


Book
Identification and other probabilistic models : Rudolf Ahlswede's lectures on information theory 6
Authors: ---
ISBN: 3030650723 3030650707 Year: 2021 Publisher: Cham, Switzerland : Springer,


Book
Transmitting and Gaining Data : Rudolf Ahlswede’s Lectures on Information Theory 2
Authors: --- --- --- ---
ISBN: 9783319125237 3319125222 9783319125220 3319125230 Year: 2015 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The calculation of channel capacities was one of Rudolf Ahlswede's specialties and is the main topic of this second volume of his Lectures on Information Theory. Here we find a detailed account of some very classical material from the early days of Information Theory, including developments from the USA, Russia, Hungary and which Ahlswede was probably in a unique position to describe the German school centered around his supervisor Konrad Jacobs. These lectures made an approach to a rigorous justification of the foundations of Information Theory. This is the second of several volumes documenting Rudolf Ahlswede's lectures on Information Theory. Each volume includes comments from an invited well-known expert. In the supplement to the present volume, Gerhard Kramer contributes his insights. Classical information processing concerns the main tasks of gaining knowledge and the storage, transmission and hiding of data. The first task is the prime goal of Statistics. For transmission and hiding of data, Shannon developed an impressive mathematical theory called Information Theory, which he based on probabilistic models. The theory largely involves the concept of codes with small error probabilities in spite of noise in the transmission, which is modeled by channels. The lectures presented in this work are suitable for graduate students in Mathematics, and also for those working in Theoretical Computer Science, Physics, and Electrical Engineering with a background in basic Mathematics. The lectures can be used as the basis for courses or to supplement courses in many ways. Ph.D. students will also find research problems, often with conjectures, that offer potential subjects for a thesis. More advanced researchers may find questions which form the basis of entire research programs.


Book
Hiding Data - Selected Topics : Rudolf Ahlswede’s Lectures on Information Theory 3
Authors: --- --- --- ---
ISBN: 3319315137 3319315153 Year: 2016 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Devoted to information security, this volume begins with a short course on cryptography, mainly based on lectures given by Rudolf Ahlswede at the University of Bielefeld in the mid 1990s. It was the second of his cycle of lectures on information theory which opened with an introductory course on basic coding theorems, as covered in Volume 1 of this series. In this third volume, Shannon’s historical work on secrecy systems is detailed, followed by an introduction to an information-theoretic model of wiretap channels, and such important concepts as homophonic coding and authentication. Once the theoretical arguments have been presented, comprehensive technical details of AES are given. Furthermore, a short introduction to the history of public-key cryptology, RSA and El Gamal cryptosystems is provided, followed by a look at the basic theory of elliptic curves, and algorithms for efficient addition in elliptic curves. Lastly, the important topic of “oblivious transfer” is discussed, which is strongly connected to the privacy problem in communication. Today, the importance of this problem is rapidly increasing, and further research and practical realizations are greatly anticipated. This is the third of several volumes serving as the collected documentation of Rudolf Ahlswede’s lectures on information theory. Each volume includes comments from an invited well-known expert. In the supplement to the present volume, Rüdiger Reischuk contributes his insights. Classical information processing concerns the main tasks of gaining knowledge and the storage, transmission and hiding of data. The first task is the prime goal of Statistics. For transmission and hiding data, Shannon developed an impressive mathematical theory called Information Theory, which he based on probabilistic models. The theory largely involves the concept of codes with small error probabilities in spite of noise in the transmission, which is modeled by channels. The lectures presented in this work are suitable for graduate students in Mathematics, and also for those working in Theoretical Computer Science, Physics, and Electrical Engineering with a background in basic Mathematics. The lectures can be used as the basis for courses or to supplement courses in many ways. Ph.D. students will also find research problems, often with conjectures, that offer potential subjects for a thesis. More advanced researchers may find questions which form the basis of entire research programs.


Book
Combinatorial Methods and Models : Rudolf Ahlswede’s Lectures on Information Theory 4
Authors: --- --- --- ---
ISBN: 3319531395 3319531379 Year: 2018 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The fourth volume of Rudolf Ahlswede’s lectures on Information Theory is focused on Combinatorics. Ahlswede was originally motivated to study combinatorial aspects of Information Theory via zero-error codes: in this case the structure of the coding problems usually drastically changes from probabilistic to combinatorial. The best example is Shannon’s zero error capacity, where independent sets in graphs have to be examined. The extension to multiple access channels leads to the Zarankiewicz problem. A code can be regarded combinatorially as a hypergraph; and many coding theorems can be obtained by appropriate colourings or coverings of the underlying hypergraphs. Several such colouring and covering techniques and their applications are introduced in this book. Furthermore, codes produced by permutations and one of Ahlswede’s favourite research fields -- extremal problems in Combinatorics -- are presented. Whereas the first part of the book concentrates on combinatorial methods in order to analyse classical codes as prefix codes or codes in the Hamming metric, the second is devoted to combinatorial models in Information Theory. Here the code concept already relies on a rather combinatorial structure, as in several concrete models of multiple access channels or more refined distortions. An analytical tool coming into play, especially during the analysis of perfect codes, is the use of orthogonal polynomials. Classical information processing concerns the main tasks of gaining knowledge and the storage, transmission and hiding of data. The first task is the prime goal of Statistics. For transmission and hiding data, Shannon developed an impressive mathematical theory called Information Theory, which he based on probabilistic models. The theory largely involves the concept of codes with small error probabilities in spite of noise in the transmission, which is modeled by channels. The lectures presented in this work are suitable for graduate students in Mathematics, and also for those working in Theoretical Computer Science, Physics, and Electrical Engineering with a background in basic Mathematics. The lectures can be used as the basis for courses or to supplement courses in many ways. Ph.D. students will also find research problems, often with conjectures, that offer potential subjects for a thesis. More advanced researchers may find questions which form the basis of entire research programs.


Book
Storing and Transmitting Data : Rudolf Ahlswede’s Lectures on Information Theory 1
Authors: --- --- --- ---
ISBN: 3319054783 3319054791 Year: 2014 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The volume “Storing and Transmitting Data” is based on Rudolf Ahlswede's introductory course on "Information Theory I" and presents an introduction to Shannon Theory. Readers, familiar or unfamiliar with the technical intricacies of Information Theory, will benefit considerably from working through the book; especially Chapter VI with its lively comments and uncensored insider views from the world of science and research offers informative and revealing insights. This is the first of several volumes that will serve as a collected research documentation of Rudolf Ahlswede’s lectures on information theory. Each volume includes comments from an invited well-known expert. Holger Boche contributed his insights in the supplement of the present volume. Classical information processing concerns the main tasks of gaining knowledge, storage, transmitting and hiding data. The first task is the prime goal of Statistics. For the two next, Shannon presented an impressive mathematical theory called Information Theory, which he based on probabilistic models. The theory largely involves the concept of codes with small error probabilities in spite of noise in the transmission, which is modeled by channels. The lectures presented in this work are suitable for graduate students in Mathematics, and also in Theoretical Computer Science, Physics, and Electrical Engineering with background in basic Mathematics. The lectures can be used as the basis for courses or to supplement courses in many ways. Ph.D. students will also find research problems, often with conjectures, that offer potential subjects for a thesis. More advanced researchers may find the basis of entire research programs.


Book
Probabilistic Methods and Distributed Information : Rudolf Ahlswede’s Lectures on Information Theory 5
Authors: --- --- --- ---
ISBN: 3030003124 3030003108 Year: 2019 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The fifth volume of Rudolf Ahlswede’s lectures on Information Theory focuses on several problems that were at the heart of a lot of his research. One of the highlights of the entire lecture note series is surely Part I of this volume on arbitrarily varying channels (AVC), a subject in which Ahlswede was probably the world's leading expert. Appended to Part I is a survey by Holger Boche and Ahmed Mansour on recent results concerning AVC and arbitrarily varying wiretap channels (AVWC). After a short Part II on continuous data compression, Part III, the longest part of the book, is devoted to distributed information. This Part includes discussions on a variety of related topics; among them let us emphasize two which are famously associated with Ahlswede: "multiple descriptions", on which he produced some of the best research worldwide, and "network coding", which had Ahlswede among the authors of its pioneering paper. The final Part IV on "Statistical Inference under Communication constraints" is mainly based on Ahlswede’s joint paper with Imre Csiszar, which received the Best Paper Award of the IEEE Information Theory Society. The lectures presented in this work, which consists of 10 volumes, are suitable for graduate students in Mathematics, and also for those working in Theoretical Computer Science, Physics, and Electrical Engineering with a background in basic Mathematics. The lectures can be used either as the basis for courses or to supplement them in many ways. Ph.D. students will also find research problems, often with conjectures, that offer potential subjects for a thesis. More advanced researchers may find questions which form the basis of entire research programs.

Listing 1 - 8 of 8
Sort by