Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
General Theory of Information Transfer and Combinatorics [[electronic resource] /] / edited by Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout Aydinian, Vladimir Blinovsky, Christian Deppe, Haik Mashurian
| General Theory of Information Transfer and Combinatorics [[electronic resource] /] / edited by Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout Aydinian, Vladimir Blinovsky, Christian Deppe, Haik Mashurian |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIII, 1128 p.) |
| Disciplina | 511/.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Data structures (Computer science) Information theory Computer Communication Networks Discrete Mathematics in Computer Science Numerical Analysis Data Structures and Information Theory |
| ISBN | 3-540-46245-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Rudolf Ahlswede — From 60 to 66 -- Information Theory and Some Friendly Neighbors – Ein Wunschkonzert -- 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 -- 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 -- 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 -- 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 -- 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 -- 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 -- Network Coding -- 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” -- Combinatorial Models -- On the Thinnest Coverings of Spheres and Ellipsoids with Balls in Hamming and Euclidean Spaces -- Appendix: On Set Coverings in Cartesian Product Spaces -- Testing Sets for 1-Perfect Code -- On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections -- On Attractive and Friendly Sets in Sequence Spaces -- Remarks on an Edge Isoperimetric Problem -- Appendix: On Edge–Isoperimetric Theorems for Uniform Hypergraphs -- Appendix: Solution of Burnashev’s Problem and a Sharpening of the Erd?s/Ko/Rado Theorem -- Realization of Intensity Modulated Radiation Fields Using Multileaf Collimators -- Sparse Asymmetric Connectors in Communication Networks -- Problem Section -- Finding , the Identification Capacity of the AVC , 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. |
| Record Nr. | UNISA-996466120003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Information Theory, Combinatorics, and Search Theory [[electronic resource] ] : In Memory of Rudolf Ahlswede / / edited by Harout Aydinian, Ferdinando Cicalese, Christian Deppe
| Information Theory, Combinatorics, and Search Theory [[electronic resource] ] : In Memory of Rudolf Ahlswede / / edited by Harout Aydinian, Ferdinando Cicalese, Christian Deppe |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XL, 773 p. 58 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Coding theory
Information theory Computer science—Mathematics Discrete mathematics Algorithms Coding and Information Theory Discrete Mathematics in Computer Science Discrete Mathematics |
| ISBN | 3-642-36899-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | I. Information Theory -- 1 Two New Results for Identification for Sources -- 2 L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order -- 3 Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme -- 4 Strong Secrecy for Multiple Access Channels -- 5 Capacity Results for Arbitrarily Varying Wiretap Channels -- 6 On Oblivious Transfer Capacity -- 7 Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay -- 8 Uniformly Generating Origin Destination Tables -- 9 Identification via Quantum Channels -- 10 Classical-Quantum Arbitrarily Varying Wiretap Channel -- 11 Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities -- 12 On the Value of Multiple Read/Write Streams for Data Compression -- 13 How to Read a Randomly Mixed Up Message -- 14 Multiple Objects: Error Exponents in Hypotheses Testing and Identification -- II. Combinatorics 15 Family Complexity and VC-Dimension -- 16 The Restricted Word Shadow Problem -- 17 Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multi-families, and Full Multitransversals -- 18 Generic Algorithms for Factoring Strings -- 19 On Data Recovery in Distributed Databases -- 20 An Unstable Hypergraph Problem with a Unique Optimal Solution -- 21 Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions -- 22 Threshold Functions for Distinct Parts: Revisiting Erd¨os–Lehner -- 23 On Some Structural Properties of Star and Pancake Graphs -- III. Search Theory -- 24 Threshold and Majority Group Testing -- 25 Superimposed Codes and Threshold Group Testing -- 26 New Construction of Error-Tolerant Pooling Designs -- 27 Density-Based Group Testing -- 28 Group Testing with Multiple Mutually-Obscuring Positives -- 29 An Efficient Algorithm for Combinatorial Group Testing -- 30 Randomized Post-optimization for t-Restrictions -- 31 Search for Sparse Active Inputs: A Review -- 32 Search When the Lie Depends on the Target -- 33 A Heuristic Solution of a Cutting Problem Using Hypergraphs -- 34 Remarks on History and Presence of Game Tree Search and Research -- 35 Multiplied Complete Fix-Free Codes and Shiftings Regarding the 3/4-Conjecture -- Michael Bodewig 36 Creating Order and Ballot Sequences -- Obituaries and Personal Memories -- Abschied -- 38 Rudi -- 39 Gedenkworte f¨ur Rudolf Ahlswede -- 40 In Memoriam Rudolf Ahlswede 1938 - 2010 -- 41 Rudolf Ahlswede 1938-2010 -- 42 Remembering Rudolf Ahlswede -- 43 Rudi Ahlswede -- 44 The Happy Connection between Rudi and Japanese Researchers -- 45 From Information Theory to Extremal Combinatorics: My Joint Works with Rudi Ahlswede -- 46 Mr. Schimanski and the Pragmatic Dean -- 47 Broken Pipes -- 48 Rudolf Ahlswede’s Funny Character -- 49 Two Anecdotes of Rudolf Ahlswede -- Bibliography of Rudolf Ahlswede’s Publications. |
| Record Nr. | UNISA-996465619403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Information Theory, Combinatorics, and Search Theory : In Memory of Rudolf Ahlswede / / edited by Harout Aydinian, Ferdinando Cicalese, Christian Deppe
| Information Theory, Combinatorics, and Search Theory : In Memory of Rudolf Ahlswede / / edited by Harout Aydinian, Ferdinando Cicalese, Christian Deppe |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XL, 773 p. 58 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Coding theory
Information theory Computer science—Mathematics Discrete mathematics Algorithms Coding and Information Theory Discrete Mathematics in Computer Science Discrete Mathematics |
| ISBN | 3-642-36899-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | I. Information Theory -- 1 Two New Results for Identification for Sources -- 2 L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order -- 3 Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme -- 4 Strong Secrecy for Multiple Access Channels -- 5 Capacity Results for Arbitrarily Varying Wiretap Channels -- 6 On Oblivious Transfer Capacity -- 7 Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay -- 8 Uniformly Generating Origin Destination Tables -- 9 Identification via Quantum Channels -- 10 Classical-Quantum Arbitrarily Varying Wiretap Channel -- 11 Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities -- 12 On the Value of Multiple Read/Write Streams for Data Compression -- 13 How to Read a Randomly Mixed Up Message -- 14 Multiple Objects: Error Exponents in Hypotheses Testing and Identification -- II. Combinatorics 15 Family Complexity and VC-Dimension -- 16 The Restricted Word Shadow Problem -- 17 Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multi-families, and Full Multitransversals -- 18 Generic Algorithms for Factoring Strings -- 19 On Data Recovery in Distributed Databases -- 20 An Unstable Hypergraph Problem with a Unique Optimal Solution -- 21 Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions -- 22 Threshold Functions for Distinct Parts: Revisiting Erd¨os–Lehner -- 23 On Some Structural Properties of Star and Pancake Graphs -- III. Search Theory -- 24 Threshold and Majority Group Testing -- 25 Superimposed Codes and Threshold Group Testing -- 26 New Construction of Error-Tolerant Pooling Designs -- 27 Density-Based Group Testing -- 28 Group Testing with Multiple Mutually-Obscuring Positives -- 29 An Efficient Algorithm for Combinatorial Group Testing -- 30 Randomized Post-optimization for t-Restrictions -- 31 Search for Sparse Active Inputs: A Review -- 32 Search When the Lie Depends on the Target -- 33 A Heuristic Solution of a Cutting Problem Using Hypergraphs -- 34 Remarks on History and Presence of Game Tree Search and Research -- 35 Multiplied Complete Fix-Free Codes and Shiftings Regarding the 3/4-Conjecture -- Michael Bodewig 36 Creating Order and Ballot Sequences -- Obituaries and Personal Memories -- Abschied -- 38 Rudi -- 39 Gedenkworte f¨ur Rudolf Ahlswede -- 40 In Memoriam Rudolf Ahlswede 1938 - 2010 -- 41 Rudolf Ahlswede 1938-2010 -- 42 Remembering Rudolf Ahlswede -- 43 Rudi Ahlswede -- 44 The Happy Connection between Rudi and Japanese Researchers -- 45 From Information Theory to Extremal Combinatorics: My Joint Works with Rudi Ahlswede -- 46 Mr. Schimanski and the Pragmatic Dean -- 47 Broken Pipes -- 48 Rudolf Ahlswede’s Funny Character -- 49 Two Anecdotes of Rudolf Ahlswede -- Bibliography of Rudolf Ahlswede’s Publications. |
| Record Nr. | UNINA-9910484541603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||