Del i serien Lecture Notes in Computer Science

General Theory of Information Transfer and Combinatorics

Häftad, Engelska, 2006

AvRudolf Ahlswede,Lars Bäumer,Ning Cai,Harout Aydinian,Vladimir Blinovsky,Christian Deppe,Haik Mashurian

1 479 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the thoroughly refereed research 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 also papers of several incorporated meetings thereof. The 63 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on probabilistic models, cryptology, pseudo random sequences, quantum models, statistics, probability theory, information measures, error concepts, performance criteria, search, sorting, ordering, planning, language evolution, pattern discovery, reconstructions, network coding, combinatorial models, and a problem section.

Produktinformation

Utgivningsdatum2006-12-14
Mått155 x 235 x 61 mm
Vikt1 697 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor1 128
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540462446

Tillhör följande kategorier

Nätverk och kommunikation inom Data och IT

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 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.

Mer från samma författare

Del 15

Probabilistic Methods and Distributed Information

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2019

1 439 kr

Del 16

Identification and Other Probabilistic Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2021

2 289 kr

Del 10

Storing and Transmitting Data

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2014

719 kr

Del 11

Transmitting and Gaining Data

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2014

739 kr

Del 12

Hiding Data - Selected Topics

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2016

1 479 kr

Del 10

Storing and Transmitting Data

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2016

739 kr

Del 11

Transmitting and Gaining Data

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2016

739 kr

Del 13

Combinatorial Methods and Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2017

1 719 kr

Del 12

Hiding Data - Selected Topics

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2018

1 579 kr

Del 13

Combinatorial Methods and Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2018

1 219 kr

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

739 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

719 kr

Compiler Construction

Albert Cohen

Häftad, 2014

709 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

739 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

739 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

739 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 209 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

739 kr

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi - Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops, Häftad

Del 15401

Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi

Häftad, 2025

959 kr

Du kanske också är intresserad av

Lectures on Advances in Combinatorics

Rudolf Ahlswede, Vladimir Blinovsky

Häftad, 2008

719 kr

Information Theory, Combinatorics, and Search Theory

Harout Aydinian, Ferdinando Cicalese, Christian Deppe

Häftad, 2013

719 kr

Del 10

Storing and Transmitting Data

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2016

739 kr

Del 15

Probabilistic Methods and Distributed Information

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2019

1 439 kr

Del 10

Storing and Transmitting Data

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2014

719 kr

Del 11

Transmitting and Gaining Data

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2016

739 kr

Del 12

Hiding Data - Selected Topics

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2018

1 579 kr

Del 13

Combinatorial Methods and Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2018

1 219 kr

Del 13

Combinatorial Methods and Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2017

1 719 kr

Del 16

Identification and Other Probabilistic Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2021

2 289 kr

Del i serien Lecture Notes in Computer Science

General Theory of Information Transfer and Combinatorics

Häftad, Engelska, 2006

AvRudolf Ahlswede,Lars Bäumer,Ning Cai,Harout Aydinian,Vladimir Blinovsky,Christian Deppe,Haik Mashurian

1 479 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum2006-12-14
Mått155 x 235 x 61 mm
Vikt1 697 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor1 128
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540462446

Tillhör följande kategorier

Nätverk och kommunikation inom Data och IT

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 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.

Mer från samma författare

Del 15

Probabilistic Methods and Distributed Information

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2019

1 439 kr

Del 16

Identification and Other Probabilistic Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2021

2 289 kr

Del 10

Storing and Transmitting Data

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2014

719 kr

Del 11

Transmitting and Gaining Data

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2014

739 kr

Del 12

Hiding Data - Selected Topics

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2016

1 479 kr

Del 10

Storing and Transmitting Data

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2016

739 kr

Del 11

Transmitting and Gaining Data

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2016

739 kr

Del 13

Combinatorial Methods and Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2017

1 719 kr

Del 12

Hiding Data - Selected Topics

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2018

1 579 kr

Del 13

Combinatorial Methods and Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2018

1 219 kr

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

739 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

719 kr

Compiler Construction

Albert Cohen

Häftad, 2014

709 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

739 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

739 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

739 kr

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Häftad, 2026

1 209 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

739 kr

Del 15401

Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops

Häftad, 2025

959 kr

Du kanske också är intresserad av

Lectures on Advances in Combinatorics

Rudolf Ahlswede, Vladimir Blinovsky

Häftad, 2008

719 kr

Information Theory, Combinatorics, and Search Theory

Harout Aydinian, Ferdinando Cicalese, Christian Deppe

Häftad, 2013

719 kr

Del 10

Storing and Transmitting Data

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2016

739 kr

Del 15

Probabilistic Methods and Distributed Information

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2019

1 439 kr

Del 10

Storing and Transmitting Data

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2014

719 kr

Del 11

Transmitting and Gaining Data

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2016

739 kr

Del 12

Hiding Data - Selected Topics

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2018

1 579 kr

Del 13

Combinatorial Methods and Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Häftad, 2018

1 219 kr

Del 13

Combinatorial Methods and Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2017

1 719 kr

Del 16

Identification and Other Probabilistic Models

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Inbunden, 2021

2 289 kr

General Theory of Information Transfer and Combinatorics

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Mer från samma författare

Mer från samma serie

Du kanske också är intresserad av

General Theory of Information Transfer and Combinatorics

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Mer från samma författare

Mer från samma serie

Du kanske också är intresserad av

General Theory of Information Transfer and Combinatorics

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Mer från samma författare

Mer från samma serie

Du kanske också är intresserad av