baumer lars (21 risultati)

Paperback. Condizione: Very Good. 1,125 pp. Tightly bound. Spine not compromised. Text is free of markings. No ownership markings.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Paperback. Condizione: Very Good. No Jacket. Former library book; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Broschiert. Condizione: Gut. Auflage: 2006. 1124 Seiten Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber. Es befindet sich lediglich ein Bibliotheksstempel im Buch; ordnungsgemäß entwidmet. Sprache: Englisch Gewicht in Gramm: 1230.

Softcover. XIII, 1124 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. X-16541 9783540462446 Sprache: Englisch Gewicht in Gramm: 1300.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Softcover. Condizione: Wie neu. Bln., Springer (2006). gr.8°. XIII, 1124 p. Pbck. Lecture Notes in Computer Science, 4123.- Further editors: L. Bäumer, N. Cai, H. Aydinian, V. Blinovsky, C. Deppe, H. Mashurian.- Like new.

Condizione: New. Brand New ! Fast Delivery "International Edition " and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 4-6 Working days .and we do have flat rate for up to 2LB. Extra shipping charges will be requested This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.

Condizione: New. In.

Condizione: New.

Condizione: New.

Taschenbuch. Condizione: Neu. General Theory of Information Transfer and Combinatorics | Rudolf Ahlswede (u. a.) | Taschenbuch | xiii | Englisch | 2006 | Springer | EAN 9783540462446 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Paperback. Condizione: Brand New. 1st edition. 1124 pages. 9.00x6.00x1.50 inches. In Stock.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book collects 63 revised, full-papers contributed to a research project on the 'General Theory of Information Transfer and Combinatorics' that was hosted from 2001-2004 at the Center for Interdisciplinary Research (ZIF) of Bielefeld University and several incorporated meetings. Topics covered include probabilistic models, cryptology, pseudo random sequences, quantum models, pattern discovery, language evolution, and network coding.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: As New. Unread book in perfect condition.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book collects 63 revised, full-papers contributed to a research project on the 'General Theory of Information Transfer and Combinatorics' that was hosted from 2001-2004 at the Center for Interdisciplinary Research (ZIF) of Bielefeld University and several incorporated meetings. Topics covered include probabilistic models, cryptology, pseudo random sequences, quantum models, pattern discovery, language evolution, and network coding. 1148 pp. Englisch.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book collects 63 revised, full-papers contributed to a research project on the General Theory of Information Transfer and Combinatorics that was hosted from 2001-2004 at the Center for Interdisciplinary Research (ZIF) of Bielefeld University and s.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 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 RestrSpringer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 1148 pp. Englisch.