000 | 08151nam a22006735i 4500 | ||
---|---|---|---|
001 | 978-3-540-46245-3 | ||
003 | DE-He213 | ||
005 | 20240730204015.0 | ||
007 | cr nn 008mamaa | ||
008 | 101221s2006 gw | s |||| 0|eng d | ||
020 |
_a9783540462453 _9978-3-540-46245-3 |
||
024 | 7 |
_a10.1007/11889342 _2doi |
|
050 | 4 | _aTK5105.5-5105.9 | |
072 | 7 |
_aUKN _2bicssc |
|
072 | 7 |
_aCOM043000 _2bisacsh |
|
072 | 7 |
_aUKN _2thema |
|
082 | 0 | 4 |
_a004.6 _223 |
245 | 1 | 0 |
_aGeneral Theory of Information Transfer and Combinatorics _h[electronic resource] / _cedited by Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout Aydinian, Vladimir Blinovsky, Christian Deppe, Haik Mashurian. |
250 | _a1st ed. 2006. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006. |
|
300 |
_aXIII, 1128 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4123 |
|
505 | 0 | _aRudolf 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 Presenceof 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 inNetwork 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. | |
650 | 0 |
_aComputer networks . _931572 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aNumerical analysis. _94603 |
|
650 | 0 |
_aData structures (Computer science). _98188 |
|
650 | 0 |
_aInformation theory. _914256 |
|
650 | 1 | 4 |
_aComputer Communication Networks. _9177875 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aNumerical Analysis. _94603 |
650 | 2 | 4 |
_aData Structures and Information Theory. _931923 |
700 | 1 |
_aAhlswede, Rudolf. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9177876 |
|
700 | 1 |
_aBäumer, Lars. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9177877 |
|
700 | 1 |
_aCai, Ning. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9177878 |
|
700 | 1 |
_aAydinian, Harout. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9177879 |
|
700 | 1 |
_aBlinovsky, Vladimir. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9177880 |
|
700 | 1 |
_aDeppe, Christian. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9177881 |
|
700 | 1 |
_aMashurian, Haik. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9177882 |
|
710 | 2 |
_aSpringerLink (Online service) _9177883 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540462446 |
776 | 0 | 8 |
_iPrinted edition: _z9783540831181 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4123 _9177884 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/11889342 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c97678 _d97678 |