Resultado de la búsqueda
14 búsqueda de la palabra clave 'Communication,'
Refinar búsqueda Generar rss de la búsqueda
Link de la búsqueda
Título : Codes: An Introduction to Information Communication and Cryptography Tipo de documento: documento electrónico Autores: Norman L. Biggs ; SpringerLink (Online service) Editorial: London : Springer London Fecha de publicación: 2008 Colección: Springer Undergraduate Mathematics Series, ISSN 1615-2085 Número de páginas: X, 274 p. 36 illus Il.: online resource ISBN/ISSN/DL: 978-1-84800-273-9 Idioma : Inglés (eng) Palabras clave: Computer science Data structures (Computer science) Coding theory Information Number Combinatorics Electrical engineering Science and Theory Communications Engineering, Networks Communication, Circuits Structures, Cryptology Clasificación: 51 Matemáticas Resumen: Information is an important feature of the modern world. Mathematical techniques underlie the devices that we use to handle it, for example, mobile phones, digital cameras, and personal computers. This book is an integrated introduction to the mathematics of coding, that is, replacing information expressed in symbols, such as a natural language or a sequence of bits, by another message using (possibly) different symbols. There are three main reasons for doing this: economy, reliability, and security, and each is covered in detail. Only a modest mathematical background is assumed, the mathematical theory being introduced at a level that enables the basic problems to be stated carefully, but without unnecessary abstraction. Other features include: clear and careful exposition of fundamental concepts, including optimal coding, data compression, and public-key cryptography; concise but complete proofs of results; coverage of recent advances of practical interest, for example in encryption standards, authentication schemes, and elliptic curve cryptography; numerous examples and exercises, and a full solutions manual available to lecturers from www.springer.com This modern introduction to all aspects of coding is suitable for advanced undergraduate or postgraduate courses in mathematics, computer science, electrical engineering, or informatics. It is also useful for researchers and practitioners in related areas of science, engineering and economics Nota de contenido: Coding and its uses -- Prefix free codes -- Economical coding -- Data compression -- Noisy channels -- The problem of reliable communication -- The noisy coding theorems -- Linear codes -- Algebraic coding theory -- Coding natural languages -- The development of cryptography -- Cryptography in theory and practice -- The RSA cryptosystem -- Cryptography and calculation -- Elliptic curve cryptography En línea: http://dx.doi.org/10.1007/978-1-84800-273-9 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34306 Codes: An Introduction to Information Communication and Cryptography [documento electrónico] / Norman L. Biggs ; SpringerLink (Online service) . - London : Springer London, 2008 . - X, 274 p. 36 illus : online resource. - (Springer Undergraduate Mathematics Series, ISSN 1615-2085) .
ISBN : 978-1-84800-273-9
Idioma : Inglés (eng)
Palabras clave: Computer science Data structures (Computer science) Coding theory Information Number Combinatorics Electrical engineering Science and Theory Communications Engineering, Networks Communication, Circuits Structures, Cryptology Clasificación: 51 Matemáticas Resumen: Information is an important feature of the modern world. Mathematical techniques underlie the devices that we use to handle it, for example, mobile phones, digital cameras, and personal computers. This book is an integrated introduction to the mathematics of coding, that is, replacing information expressed in symbols, such as a natural language or a sequence of bits, by another message using (possibly) different symbols. There are three main reasons for doing this: economy, reliability, and security, and each is covered in detail. Only a modest mathematical background is assumed, the mathematical theory being introduced at a level that enables the basic problems to be stated carefully, but without unnecessary abstraction. Other features include: clear and careful exposition of fundamental concepts, including optimal coding, data compression, and public-key cryptography; concise but complete proofs of results; coverage of recent advances of practical interest, for example in encryption standards, authentication schemes, and elliptic curve cryptography; numerous examples and exercises, and a full solutions manual available to lecturers from www.springer.com This modern introduction to all aspects of coding is suitable for advanced undergraduate or postgraduate courses in mathematics, computer science, electrical engineering, or informatics. It is also useful for researchers and practitioners in related areas of science, engineering and economics Nota de contenido: Coding and its uses -- Prefix free codes -- Economical coding -- Data compression -- Noisy channels -- The problem of reliable communication -- The noisy coding theorems -- Linear codes -- Algebraic coding theory -- Coding natural languages -- The development of cryptography -- Cryptography in theory and practice -- The RSA cryptosystem -- Cryptography and calculation -- Elliptic curve cryptography En línea: http://dx.doi.org/10.1007/978-1-84800-273-9 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34306 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Boolean Function Complexity : Advances and Frontiers Tipo de documento: documento electrónico Autores: Stasys Jukna ; SpringerLink (Online service) Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2012 Colección: Algorithms and Combinatorics, ISSN 0937-5511 num. 27 Número de páginas: XVI, 620 p Il.: online resource ISBN/ISSN/DL: 978-3-642-24508-4 Idioma : Inglés (eng) Palabras clave: Mathematics Computers Computer science Information theory Combinatorics and Communication, Circuits Theory of Computation Computing Clasificación: 51 Matemáticas Resumen: Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics Nota de contenido: Part I Basics -- Part II Communication Complexity -- Part III Circuit Complexity -- Part IV Bounded Depth Circuits -- Part V Branching Programs -- Part VI Fragments of Proof Complexity -- A Epilog -- B Mathematical Background -- References -- Index En línea: http://dx.doi.org/10.1007/978-3-642-24508-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32946 Boolean Function Complexity : Advances and Frontiers [documento electrónico] / Stasys Jukna ; SpringerLink (Online service) . - Berlin, Heidelberg : Springer Berlin Heidelberg, 2012 . - XVI, 620 p : online resource. - (Algorithms and Combinatorics, ISSN 0937-5511; 27) .
ISBN : 978-3-642-24508-4
Idioma : Inglés (eng)
Palabras clave: Mathematics Computers Computer science Information theory Combinatorics and Communication, Circuits Theory of Computation Computing Clasificación: 51 Matemáticas Resumen: Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics Nota de contenido: Part I Basics -- Part II Communication Complexity -- Part III Circuit Complexity -- Part IV Bounded Depth Circuits -- Part V Branching Programs -- Part VI Fragments of Proof Complexity -- A Epilog -- B Mathematical Background -- References -- Index En línea: http://dx.doi.org/10.1007/978-3-642-24508-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32946 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Stochastic Networked Control Systems : Stabilization and Optimization under Information Constraints Tipo de documento: documento electrónico Autores: Serdar Yüksel ; SpringerLink (Online service) ; Tamer Basar Editorial: New York, NY : Springer New York Fecha de publicación: 2013 Otro editor: Imprint: Birkhäuser Colección: Systems & Control: Foundations & Applications, ISSN 2324-9749 Número de páginas: XVIII, 482 p Il.: online resource ISBN/ISSN/DL: 978-1-4614-7085-4 Idioma : Inglés (eng) Palabras clave: Mathematics Computer organization Computers Information theory System Mathematical optimization Electrical engineering and Communication, Circuits Systems Organization Communication Networks Theory, Control Communications Engineering, Service Optimization Clasificación: 51 Matemáticas Resumen: Networked control systems are increasingly ubiquitous today, with applications ranging from vehicle communication and adaptive power grids to space exploration and economics. The optimal design of such systems presents major challenges, requiring tools from various disciplines within applied mathematics such as decentralized control, stochastic control, information theory, and quantization. A thorough, self-contained book, Stochastic Networked Control Systems: Stabilization and Optimization under Information Constraints aims to connect these diverse disciplines with precision and rigor, while conveying design guidelines to controller architects. Unique in the literature, it lays a comprehensive theoretical foundation for the study of networked control systems, and introduces an array of concrete tools for work in the field. Salient features include: · Characterization, comparison and optimal design of information structures in static and dynamic teams. Operational, structural and topological properties of information structures in optimal decision making, with a systematic program for generating optimal encoding and control policies. The notion of signaling, and its utilization in stabilization and optimization of decentralized control systems. · Presentation of mathematical methods for stochastic stability of networked control systems using random-time, state-dependent drift conditions and martingale methods. · Characterization and study of information channels leading to various forms of stochastic stability such as stationarity, ergodicity, and quadratic stability; and connections with information and quantization theories. Analysis of various classes of centralized and decentralized control systems. · Jointly optimal design of encoding and control policies over various information channels and under general optimization criteria, including a detailed coverage of linear-quadratic-Gaussian models. · Decentralized agreement and dynamic optimization under information constraints. This monograph is geared toward a broad audience of academic and industrial researchers interested in control theory, information theory, optimization, economics, and applied mathematics. It could likewise serve as a supplemental graduate text. The reader is expected to have some familiarity with linear systems, stochastic processes, and Markov chains, but the necessary background can also be acquired in part through the four appendices included at the end Nota de contenido: Introduction -- Part I Information Structures in Networked Control -- Networked Control Systems as Stochastic Team Decision Problems: A General Introduction -- Characterization and Comparison of Information Structures -- Topological Properties of Information Structures: Comparison, Convergence and Optimization -- Part II Stabilization of Networked Control Systems -- Coding for Control and Connections with Information Theory -- Stochastic Stability and Drift Criteria for Markov Chains in Networked Control -- Stochastic Stabilization over Noiseless Channels -- Stochastic Stabilization over Noisy Channels -- Stabilization of Decentralized Systems over Communication Channels -- Part III Optimization in Networked Control: Design of Optimal Policies under Information Constraints -- Optimization of Real-Time Coding and Control Policies: Structural and Existence Results -- Optimal Coding and Control for Linear Gaussian Systems over Gaussian Channels under Quadratic Cost -- Agreement in Teams and the Dynamic Programming Approach under Information Constraints -- A Topological Notions and Optimization -- B Probability Theory and Stochastic Processes -- C Markov Chains, Martingales and Ergodic Processes -- D Markov Decision Theory and Optimality of Markov Policies -- References -- Index En línea: http://dx.doi.org/10.1007/978-1-4614-7085-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32334 Stochastic Networked Control Systems : Stabilization and Optimization under Information Constraints [documento electrónico] / Serdar Yüksel ; SpringerLink (Online service) ; Tamer Basar . - New York, NY : Springer New York : Imprint: Birkhäuser, 2013 . - XVIII, 482 p : online resource. - (Systems & Control: Foundations & Applications, ISSN 2324-9749) .
ISBN : 978-1-4614-7085-4
Idioma : Inglés (eng)
Palabras clave: Mathematics Computer organization Computers Information theory System Mathematical optimization Electrical engineering and Communication, Circuits Systems Organization Communication Networks Theory, Control Communications Engineering, Service Optimization Clasificación: 51 Matemáticas Resumen: Networked control systems are increasingly ubiquitous today, with applications ranging from vehicle communication and adaptive power grids to space exploration and economics. The optimal design of such systems presents major challenges, requiring tools from various disciplines within applied mathematics such as decentralized control, stochastic control, information theory, and quantization. A thorough, self-contained book, Stochastic Networked Control Systems: Stabilization and Optimization under Information Constraints aims to connect these diverse disciplines with precision and rigor, while conveying design guidelines to controller architects. Unique in the literature, it lays a comprehensive theoretical foundation for the study of networked control systems, and introduces an array of concrete tools for work in the field. Salient features include: · Characterization, comparison and optimal design of information structures in static and dynamic teams. Operational, structural and topological properties of information structures in optimal decision making, with a systematic program for generating optimal encoding and control policies. The notion of signaling, and its utilization in stabilization and optimization of decentralized control systems. · Presentation of mathematical methods for stochastic stability of networked control systems using random-time, state-dependent drift conditions and martingale methods. · Characterization and study of information channels leading to various forms of stochastic stability such as stationarity, ergodicity, and quadratic stability; and connections with information and quantization theories. Analysis of various classes of centralized and decentralized control systems. · Jointly optimal design of encoding and control policies over various information channels and under general optimization criteria, including a detailed coverage of linear-quadratic-Gaussian models. · Decentralized agreement and dynamic optimization under information constraints. This monograph is geared toward a broad audience of academic and industrial researchers interested in control theory, information theory, optimization, economics, and applied mathematics. It could likewise serve as a supplemental graduate text. The reader is expected to have some familiarity with linear systems, stochastic processes, and Markov chains, but the necessary background can also be acquired in part through the four appendices included at the end Nota de contenido: Introduction -- Part I Information Structures in Networked Control -- Networked Control Systems as Stochastic Team Decision Problems: A General Introduction -- Characterization and Comparison of Information Structures -- Topological Properties of Information Structures: Comparison, Convergence and Optimization -- Part II Stabilization of Networked Control Systems -- Coding for Control and Connections with Information Theory -- Stochastic Stability and Drift Criteria for Markov Chains in Networked Control -- Stochastic Stabilization over Noiseless Channels -- Stochastic Stabilization over Noisy Channels -- Stabilization of Decentralized Systems over Communication Channels -- Part III Optimization in Networked Control: Design of Optimal Policies under Information Constraints -- Optimization of Real-Time Coding and Control Policies: Structural and Existence Results -- Optimal Coding and Control for Linear Gaussian Systems over Gaussian Channels under Quadratic Cost -- Agreement in Teams and the Dynamic Programming Approach under Information Constraints -- A Topological Notions and Optimization -- B Probability Theory and Stochastic Processes -- C Markov Chains, Martingales and Ergodic Processes -- D Markov Decision Theory and Optimality of Markov Policies -- References -- Index En línea: http://dx.doi.org/10.1007/978-1-4614-7085-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32334 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar Wireless Communications / SpringerLink (Online service) ; Prathima Agrawal ; Philip J. Fleming ; Lisa Zhang ; Daniel Matthew Andrews ; George Yin (2007)
Título : Wireless Communications Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Prathima Agrawal ; Philip J. Fleming ; Lisa Zhang ; Daniel Matthew Andrews ; George Yin Editorial: New York, NY : Springer New York Fecha de publicación: 2007 Colección: The IMA Volumes in Mathematics and its Applications, ISSN 0940-6573 num. 143 Número de páginas: X, 370 p Il.: online resource ISBN/ISSN/DL: 978-0-387-48945-2 Idioma : Inglés (eng) Palabras clave: Mathematics Applied mathematics Engineering Information theory Computer Popular works and Communication, Circuits Computational Science Science, general Applications of Clasificación: 51 Matemáticas Resumen: This volume contains papers based on invited talks given at the 2005 IMA Summer Workshop on Wireless Communications, held at the Institute for Mathematics and Its Applications, University of Minnesota, June 22 - July 1, 2005. The workshop provided a great opportunity to facilitate the communications between academia and the industry, and to bridge the mathematical sciences, engineering, information theory, and communication communities. The emphases were on design and analysis of computationally efficient algorithms to better understand the behavior and to control the wireless telecommunication networks. As an archive, this volume presents some of the highlights of the workshop, and collects papers covering a broad spectrum of important and pressing issues in wireless communications. All papers have been reviewed. One of the book's distinct features is highly multi-disciplinary. This book is useful for researchers and advanced graduate students working in communication networks, information theory, signal processing, and applied probability and stochastic processes, among others Nota de contenido: A Survey of Scheduling Theory in Wireless Data Networks -- Wireless Channel Parameters Maximizing TCP Throughput -- Heavy Traffic Methods in Wireless Systems: Towards Modeling Heavy Tails and Long Range Dependence -- Structural Results on Optimal Transmission Scheduling over Dynamical Fading Channels: A Constrained Markov Decision Process Approach -- Entropy, Inference, and Channel Coding -- Optimization of Wireless Multiple Antenna Communication System Throughput Via Quantized Rate Control -- Communication Strategies and Coding for Relaying -- Scheduling and Control of Multi-Node Mobile Communications Systems with Randomly-Varying Channels by Stability Methods -- A Game Theoretic Approach to Interference Management in Cognitive Networks -- Enabling Interoperability of Heterogeneous ad hoc Networks -- Overlay Networks for Wireless ad hoc Networks -- Dimensionality Reduction, Compression and Quantization for Distributed Estimation with Wireless Sensor Networks -- Fair Allocation of A Wireless Fading Channel: An Auction Approach -- Modelling and Stability of Fast TCP En línea: http://dx.doi.org/10.1007/978-0-387-48945-2 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34483 Wireless Communications [documento electrónico] / SpringerLink (Online service) ; Prathima Agrawal ; Philip J. Fleming ; Lisa Zhang ; Daniel Matthew Andrews ; George Yin . - New York, NY : Springer New York, 2007 . - X, 370 p : online resource. - (The IMA Volumes in Mathematics and its Applications, ISSN 0940-6573; 143) .
ISBN : 978-0-387-48945-2
Idioma : Inglés (eng)
Palabras clave: Mathematics Applied mathematics Engineering Information theory Computer Popular works and Communication, Circuits Computational Science Science, general Applications of Clasificación: 51 Matemáticas Resumen: This volume contains papers based on invited talks given at the 2005 IMA Summer Workshop on Wireless Communications, held at the Institute for Mathematics and Its Applications, University of Minnesota, June 22 - July 1, 2005. The workshop provided a great opportunity to facilitate the communications between academia and the industry, and to bridge the mathematical sciences, engineering, information theory, and communication communities. The emphases were on design and analysis of computationally efficient algorithms to better understand the behavior and to control the wireless telecommunication networks. As an archive, this volume presents some of the highlights of the workshop, and collects papers covering a broad spectrum of important and pressing issues in wireless communications. All papers have been reviewed. One of the book's distinct features is highly multi-disciplinary. This book is useful for researchers and advanced graduate students working in communication networks, information theory, signal processing, and applied probability and stochastic processes, among others Nota de contenido: A Survey of Scheduling Theory in Wireless Data Networks -- Wireless Channel Parameters Maximizing TCP Throughput -- Heavy Traffic Methods in Wireless Systems: Towards Modeling Heavy Tails and Long Range Dependence -- Structural Results on Optimal Transmission Scheduling over Dynamical Fading Channels: A Constrained Markov Decision Process Approach -- Entropy, Inference, and Channel Coding -- Optimization of Wireless Multiple Antenna Communication System Throughput Via Quantized Rate Control -- Communication Strategies and Coding for Relaying -- Scheduling and Control of Multi-Node Mobile Communications Systems with Randomly-Varying Channels by Stability Methods -- A Game Theoretic Approach to Interference Management in Cognitive Networks -- Enabling Interoperability of Heterogeneous ad hoc Networks -- Overlay Networks for Wireless ad hoc Networks -- Dimensionality Reduction, Compression and Quantization for Distributed Estimation with Wireless Sensor Networks -- Fair Allocation of A Wireless Fading Channel: An Auction Approach -- Modelling and Stability of Fast TCP En línea: http://dx.doi.org/10.1007/978-0-387-48945-2 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34483 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Algebraic Function Fields and Codes Tipo de documento: documento electrónico Autores: Henning Stichtenoth ; SpringerLink (Online service) Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2009 Colección: Graduate Texts in Mathematics, ISSN 0072-5285 num. 254 Número de páginas: XIV, 360 p Il.: online resource ISBN/ISSN/DL: 978-3-540-76878-4 Idioma : Inglés (eng) Palabras clave: Mathematics Data structures (Computer science) Algebra Algebraic geometry Information theory Applied mathematics Engineering Geometry Structures, Cryptology and Theory Communication, Circuits Appl.Mathematics/Computational Methods of Clasificación: 51 Matemáticas Resumen: The theory of algebraic function fields has its origins in number theory, complex analysis (compact Riemann surfaces), and algebraic geometry. Since about 1980, function fields have found surprising applications in other branches of mathematics such as coding theory, cryptography, sphere packings and others. The main objective of this book is to provide a purely algebraic, self-contained and in-depth exposition of the theory of function fields. This new edition, published in the series Graduate Texts in Mathematics, has been considerably expanded. Moreover, the present edition contains numerous exercises. Some of them are fairly easy and help the reader to understand the basic material. Other exercises are more advanced and cover additional material which could not be included in the text. This volume is mainly addressed to graduate students in mathematics and theoretical computer science, cryptography, coding theory and electrical engineering Nota de contenido: Foundations of the Theory of Algebraic Function Fields -- Algebraic Geometry Codes -- Extensions of Algebraic Function Fields -- Differentials of Algebraic Function Fields -- Algebraic Function Fields over Finite Constant Fields -- Examples of Algebraic Function Fields -- Asymptotic Bounds for the Number of Rational Places -- More about Algebraic Geometry Codes -- Subfield Subcodes and Trace Codes En línea: http://dx.doi.org/10.1007/978-3-540-76878-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34025 Algebraic Function Fields and Codes [documento electrónico] / Henning Stichtenoth ; SpringerLink (Online service) . - Berlin, Heidelberg : Springer Berlin Heidelberg, 2009 . - XIV, 360 p : online resource. - (Graduate Texts in Mathematics, ISSN 0072-5285; 254) .
ISBN : 978-3-540-76878-4
Idioma : Inglés (eng)
Palabras clave: Mathematics Data structures (Computer science) Algebra Algebraic geometry Information theory Applied mathematics Engineering Geometry Structures, Cryptology and Theory Communication, Circuits Appl.Mathematics/Computational Methods of Clasificación: 51 Matemáticas Resumen: The theory of algebraic function fields has its origins in number theory, complex analysis (compact Riemann surfaces), and algebraic geometry. Since about 1980, function fields have found surprising applications in other branches of mathematics such as coding theory, cryptography, sphere packings and others. The main objective of this book is to provide a purely algebraic, self-contained and in-depth exposition of the theory of function fields. This new edition, published in the series Graduate Texts in Mathematics, has been considerably expanded. Moreover, the present edition contains numerous exercises. Some of them are fairly easy and help the reader to understand the basic material. Other exercises are more advanced and cover additional material which could not be included in the text. This volume is mainly addressed to graduate students in mathematics and theoretical computer science, cryptography, coding theory and electrical engineering Nota de contenido: Foundations of the Theory of Algebraic Function Fields -- Algebraic Geometry Codes -- Extensions of Algebraic Function Fields -- Differentials of Algebraic Function Fields -- Algebraic Function Fields over Finite Constant Fields -- Examples of Algebraic Function Fields -- Asymptotic Bounds for the Number of Rational Places -- More about Algebraic Geometry Codes -- Subfield Subcodes and Trace Codes En línea: http://dx.doi.org/10.1007/978-3-540-76878-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34025 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar PermalinkPermalinkPermalinkPermalinkPermalink
