Ahlswede R., B?umer L., Cai N., Aydinian H., Blinovsky V., Deppe C., Mashurian H. (eds.) General Theory of Information Transfer and Combinatorics



Ahlswede R., B?umer L., Cai N., Aydinian H., Blinovsky V., Deppe C., Mashurian H. (eds.) General Theory of Information Transfer and Combinatorics
31.01.2012 в 01:43 9.46 Мб pdf 9 раз
Издательство Springer, 2006, -1137 pp.

The Center for Interdisciplinary Research (ZiF) of the University of Bielefeld hosted a research group under the title General Theory of Information Transfer and Combinatorics, abbreviated as GTIT-C, from October 1, 2001 to September 30, 2004. As head of the research group the editor shaped the group’s scientific directions and its personal composition.
He followed ideas, problems and results which had occupied him during the past decade and which seem to extend the frontiers of information theory in several directions. The main contributions concern information transfer by channels. There are also new questions and some answers in new models of source coding. While many of the investigations are in an explorative state, there are also hard cores of mathematical theories. In particular, a unified theory of information transfer was presented, which naturally incorporates Shannon’s Theory of Information Transmission and the Theory of Identification in the presence of noise as extremal cases. It provides several novel coding theorems. On the source coding side the concept of identification entropy is introduced. Finally, beyond information theory new concepts of solutions for probabilistic algorithms arose.
In addition to this book there will be a special issue of Discrete Applied Mathematics General Theory of Information Transfer and Combinatorics in three parts, which covers primarily work with a stronger emphasis on the second component, combinatorics. It begins with an updated version of General Theory of Information Transfer in order to make the theory known to a broader audience and continues with other new directions such as bioinformatics, search, sorting and ordering, cryptology and number theory, and networks with many new suggestions for connections.
It includes in a special volume works and abstracts of lectures devoted to the great Levon Khachatrian at the memorial held for him during the Opening Conference, November 4-9, 2002.
In a preparatory year, October 1, 2001 – September 30, 2002, guided by the general concepts and ideas indicated and described in greater detail in the present introduction, researchers and research institutions were approached worldwide in order to find out which possible participants might be and which more concrete projects could be realized in the main research year, October 1, 2002 to August 31, 2003.
Central events in this phase were two weekly preparatory meetings in February: General Theory of Information Transfer, abbreviated as GTIT, and Information in Natural Sciences, Social Sciences, Humanities and Engineering. Abstracts of the lectures can be found at
The main goals were to test the applicability of the GTIT, particularly identification, and to strive for new information phenomena in the sciences, which can be modelled mathematically. Readers are strongly advised to read the Introduction for guidance.

Introduction.
Rudolf Ahlswede – From 60 to 66.
Information Theory and Some Friendly Neighbors – Ein Wunschkonzert.
I Probabilistic Models.
Identification for Sources.
On Identification.
Identification and Prediction.
Watermarking Identification Codes with Related Topics on Common Randomness.
Notes on Conditions for Successive Refinement of Information.
Coding for the Multiple-Access Adder Channel.
Bounds of E-Capacity for Multiple-Access Channel with Random Parameter.
Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint.
Codes with the Identifiable Parent Property and the Multiple-Access Channel.
II Cryptology – Pseudo Random Sequences.
Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder.
A Simplified Method for Computing the Key Equivocation for Additive-Like Instantaneous Block Encipherers.
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer.
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I.
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II.
On a Fast Version of a Pseudorandom Generator.
On Pseudorandom Sequences and Their Application.
Authorship Attribution of Texts: A Review.
III Quantum Models.
Raum-Zeit und Quantenphysik – Ein Geburtstagsst?ndchen f?r Hans-J?rgen Treder.
Quantum Information Transfer from One System to Another One.
On Rank Two Channels.
Universal Sets of Quantum Information Processing Primitives and Their Optimal Use.
An Upper Bound on the Rate of Information Transfer by Grover’s Oracle.
A Strong Converse Theorem for Quantum Multiple Access Channels.
Identification Via Quantum Channels in the Presence of Prior Correlation and Feedback.
Additive Number Theory and the Ring of Quantum Integers.
The Proper Fiducial Argument.
On Sequential Discrimination Between Close Markov Chains.
Estimating with Randomized Encoding the Joint Empirical Distribution in a Correlated Source.
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information.
On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification.
Correlation Inequalities in Function Spaces.
Lower Bounds for Divergence in the Central Limit Theorem.
V Information Measures – Error Concepts – Performance Criteria.
Identification Entropy.
Optimal Information Measures for Weakly Chaotic Dynamical Systems.
Report on Models of Write–Efficient Memories with Localized Errors and Defects.
Percolation on a k-Ary Tree.
On Concepts of Performance Parameters for Channels.
Appendix: On Common Information and Related Characteristics of Correlated Information Sources.
VI Search – Sorting – Ordering – Planning.
Q-Ary Ulam-Renyi Game with Constrained Lies.
Search with Noisy and Delayed Responses.
A Kraft–Type Inequality for d–Delay Binary Search Codes.
Threshold Group Testing.
A Fast Suffix-Sorting Algorithm.
Monotonicity Checking.
Algorithmic Motion Planning: The Randomized Approach.
VII Language Evolution – Pattern Discovery – Reconstructions.
Information Theoretic Models in Language Evolution.
Zipf’s Law, Hyperbolic Distributions and Entropy Loss.
Bridging Lossy and Lossless Compression by Motif Pattern Discovery.
Reverse–Complement Similarity Codes.
On Some Applications of Information Indices in Chemical Graph Theory.
Largest Graphs of Diameter 2 and Maximum Degree 6.
An Outside Opinion.
Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis Utilising Public Information in Network Coding.
IX Combinatorial Models.
Coverings.
On the Thinnest Coverings of Spheres and Ellipsoids with Balls in Hamming and Euclidean Spaces.
Appendix: On Set Coverings in Cartesian Product Spaces.
Partitions.
Testing Sets for 1-Perfect Code.
On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections.
Isoperimetry.
On Attractive and Friendly Sets in Sequence Spaces.
Remarks on an Edge Isoperimetric Problem.
Appendix: On Edge–Isoperimetric Theorems for Uniform Hypergraphs.
Isodiametry.
Appendix: Solution of Burnashev’s Problem and a Sharpening of the Erd?os/Ko/Rado Theorem.
Networks.
Realization of Intensity Modulated Radiation Fields Using Multileaf Collimators.
Sparse Asymmetric Connectors in Communication Networks.
X Problem Section.
Finding CNRI(W), the Identification Capacity of the AVC W, if Randomization in the Encoding Is Excluded.
Intersection Graphs of Rectangles and Segments.
Cutoff Rate Enhancement.
Some Problems in Organic Coding Theory.
Generalized Anticodes in Hamming Spaces.
Two Problems from Coding Theory.
Private Capacity of Broadcast Channels.
A Short Survey on Upper and Lower Bounds for Multidimensional Zero Sums.
Binary Linear Codes That Are Optimal for Error Correction.
Capacity Problem of Trapdoor Channel.
Hotlink Assignment on the Web.
The Rigidity of Hamming Spaces.
A Conjecture in Finite Fields.
Multiparty Computations in Non-private Environments.
Some Mathematical Problems Related to Quantum Hypothesis Testing.
Designs and Perfect Codes.
Special Issue of Discrete Applied Mathematics: General Theory of Information Transfer and Combinatorics List D.
Bibliography of Publications by Rudolf Ahlswede.
Скачать / Download

Комментарии


Смотрите также


Ashlswede R., Blinovsky V. Lectures on Advances in Combinatorics

Ashlswede R., Blinovsky V. Lectures on Advances in Combinatorics

разное
Springer, 2008. - 314 pages.

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 ...
14.01.2011 в 00:07 3.02 Мб 7 раз
Wilf H.S. Generatingfunctionology

Wilf H.S. Generatingfunctionology

разное
A K Peters, 2006. - 245 pages.
Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in.
* Combinatorics.
* Probability Theory.
* Statisti...
03.07.2011 в 15:02 1.54 Мб 8 раз
Crnkovi? D., Tonchev V. (eds.) Information Security, Coding Theory and Related Combinatorics. Information Coding and Combinatorics

Crnkovi? D., Tonchev V. (eds.) Information Security, Coding Theory and Related Combinatorics. Information Coding and Combinatorics

разное
Издательство IOS Press, 2011, -460 pp.

This book contains papers based on lectures presented at the NATO Advanced Study Institute "Information Security and Related Combinatorics", held in the beautiful town of Opatija at the Adriatic Coast of Croatia from May 31 to June 11, 2010. On behalf of all participants, we would ...
15.10.2011 в 20:15 6.78 Мб 5 раз
Ray-Chaudhuri D. Coding Theory and Design Theory. Part I

Ray-Chaudhuri D. Coding Theory and Design Theory. Part I

разное
Издательство Springer, 1990, -252 pp.

This book is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on Applied Combinatorics. Coding Theory and Design theory are areas of combinatorics which found rich applications of algebraic structures and are closely interconnected. Coding...
15.10.2011 в 20:10 10.88 Мб 6 раз
Fulton W. Young Tableaux: With Applications to Representation Theory and Geometry

Fulton W. Young Tableaux: With Applications to Representation Theory and Geometry

разное
Cambridge University Press, 1997. - 270 Pages.

This book develops the combinatorics of Young tableaux and shows them in action in the algebra of symmetric functions, representations of the symmetric and general linear groups, and the geometry of flag varieties. The first part of the book is a self-contained presentatio...
31.01.2012 в 01:03 2.24 Мб 17 раз
Betten (etc.) Error-Correcting Linear Codes. Classification by Isometry and Applications

Betten (etc.) Error-Correcting Linear Codes. Classification by Isometry and Applications

разное
Издательство Springer, 2006, -818 pp.

The fascinating theory of error-correcting codes is a rather new addition to the list of mathematical disciplines. It grew out of the need to communicate information electronically, and is currently no more than 60 years old. Being an applied discipline by definition, a surprisingly...
05.12.2011 в 01:38 6.67 Мб 8 раз
Kisacanin B. Mathematical Problems and Proofs: Combinatorics, Number Theory, and Geometry

Kisacanin B. Mathematical Problems and Proofs: Combinatorics, Number Theory, and Geometry

разное
Kluwer Academic Publishers, 2002. - 220 pages.
Key to Symbols.
Set Theory.
Sets and Elementary Set Operations.
Cartesian Product and Relations.
Functions and Operations.
Cardinality.
Problems.
Combinatorics.
Four Enumeration Principles.
Introductory Problems.
Basic Defini...
31.01.2012 в 00:53 1.31 Мб 12 раз
Lothaire M. Algebraic Combinatorics on Words

Lothaire M. Algebraic Combinatorics on Words

разное
Издательство Cambridge University Press, 2002, -515 pp.

Combinatorics on words is a field that has grown separately within several branches of mathematics, such as number theory, group theory or probability theory, and appears frequently in problems of theoretical computer science, as dealing with automata and formal la...
15.12.2011 в 08:43 4.52 Мб 13 раз
Harris J.M., Hirst J.L., Mossinghoff M.J. Combinatorics and Graph Theory

Harris J.M., Hirst J.L., Mossinghoff M.J. Combinatorics and Graph Theory

разное
Springer New York, 2010. - 400 pages.

This book covers a wide variety of topics in combinatorics and graph theory. It includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. In addition, recent results appear in the text, illustrating the fact that mathe...
18.12.2010 в 01:55 3.34 Мб 13 раз
Bergeron F. Algebraic Combinatorics and Coinvariant Spaces

Bergeron F. Algebraic Combinatorics and Coinvariant Spaces

разное
A K Peters/CRC, 2009. - 230 pages.

Written for graduate students in mathematics or non-specialist mathematicians who wish to learn the basics about some of the most important current research in the field, this book provides an intensive, yet accessible, introduction to the subject of algebraic combinatorics. After rec...
12.05.2011 в 20:17 7.43 Мб 4 раза