Bibliografías temáticas / Erasure Coding

Índice

Artículos de revistas
Tesis
Libros
Capítulos de libros
Actas de conferencias
Informes

Literatura académica sobre el tema "Erasure Coding"

Autor: Grafiati

Publicado: 4 de junio de 2021

Última modificación: 17 de junio de 2025

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Erasure Coding".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Artículos de revistas sobre el tema "Erasure Coding"

Li, Yusheng. "Analysis for RS-coding and fountain-code for erasure coding." Applied and Computational Engineering 14, no. 1 (2023): 229–34. http://dx.doi.org/10.54254/2755-2721/14/20230794.

Texto completo

Resumen

This research provides an in-depth analysis of RS-coding and fountain-coding for erasure cod-ing, focusing on the different circumstances that data storage may face during daily usage. The essay outlines the fundamental information of RS-code and fountain-code, and com-pares their effectiveness in addressing varying degrees of erasure in the data disk. The research includes case studies and content analysis to identify appropriate circumstances for using dif-ferent coding methods. Based on these findings, the research concludes that RS-coding is more effective when fixing erasures up to a certain limit, beyond which fountain-coding is a better option. Finally, the research presents a research example to demonstrate the practical usage of different coding methods in specific circumstances, highlighting the advantages and disad-vantages between the two coding systems. Overall, this research provides valuable insights into erasure coding and can aid in optimizing data storage systems for efficient and reliable per-formance.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Chen, Jianning. "An Investigation on Reed-Solomon Codes as Erasure Coding Technique on Its Properties and Utilizations." Highlights in Science, Engineering and Technology 81 (January 26, 2024): 553–58. http://dx.doi.org/10.54097/v7sdrs06.

Texto completo

Resumen

Erasure coding is an essential part of cloud computing, which is an important technology for effective data storage for recovering data that may be lost due to various reasons, there are various erasure coding techniques in the market. In this paper, linear MDS codes, which is a branch of erasure coding, will be investigated on their performance and usage. This paper will focus on the Reed-Solomon Code, which is the most implemented form of linear MDS codes, on three different aspects: 1) the methodologies of the encoding and decoding operations; 2) the pros and cons of different forms of Reed-Solomon Codes; 3) the different ways that different Reed-Solomon Codes are being employed. Moreover, the paper includes the definition of general Cloud Computing for the audience to understand its importance, how the erasure coding acts like a fault tolerance system of Cloud Computing, and how different kinds of Reed-Solomon code perform on tolerating erasures in cloud storage failures.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Lei, Fan, Junqi Chen, Yong Wang, and Sijie Yang. "FPGA-Accelerated Erasure Coding Encoding in Ceph Based on an Efficient Layered Strategy." Electronics 13, no. 3 (2024): 593. http://dx.doi.org/10.3390/electronics13030593.

Texto completo

Resumen

Distributed storage systems such as Ceph have been widely adopted, with erasure coding technology being an essential fault-tolerance technique. While ensuring data reliability and security, it significantly reduces the cost of data storage. Due to the computational overhead and encoding latency introduced by the erasure coding process, the data encoding rate is often constrained. To address this issue, an FPGA-accelerated erasure coding encoding scheme in Ceph, based on an efficient layered strategy (FPGA-Accelerated Erasure Coding Encoding in Ceph with an Efficient Layered Strategy, LFEC-Accelerator), is proposed and implemented. This approach takes full advantage of FPGA’s parallel computing capabilities to accelerate the erasure coding algorithm at the hardware level. Furthermore, to maximize the utilization of the FPGA controller’s resources and ensure that all processing steps are properly managed and scheduled, our approach introduces a hierarchical structure comprising a communication interface layer, task scheduling layer, and hardware acceleration layer. Experimental results indicate that, under the same erasure coding configurations and file sizes, our solution outperforms native Ceph-supported erasure coding libraries such as Jerasure, Clay, Shec and ISA, with an encoding rate improvement of up to 3.04 times.

Los estilos APA, Harvard, Vancouver, ISO, etc.

S, Sangeetha, and Priya N. "Analyzing Erasure Coding and Gigabit Switches with Xmas." Journal of Advanced Research in Dynamical and Control Systems 11, no. 0009-SPECIAL ISSUE (2019): 875–81. http://dx.doi.org/10.5373/jardcs/v11/20192646.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Hanushevsky, Andrew, Michal Kamil Simon, and Wei Yang. "Erasure Coding XRootD Object Store." EPJ Web of Conferences 295 (2024): 01024. http://dx.doi.org/10.1051/epjconf/202429501024.

Texto completo

Resumen

An erasure coding (EC) algorithm was implemented in XRootD client library, and an EC-enabled XRootD storage prototype was set up at SLAC for evaluation. The architecture and configuration of the prototype is almost identical to that of a traditional non-EC XRootD storage behind a firewall: a backend XRootD storage cluster in its simplest form, and an internet facing XRootD proxy. This proxy handles EC and spreads the data stripes of a file/object across several backend nodes. It also supports all functions used on a WLCG storage system: HTTP(s) and XRootD protocols, Third Party Copy, X509/VOMS/Token, etc. The cross-node EC architecture brings significant advantages in both performance and resilience: e.g. parallel data access, tolerance of downtime and hardware failure. It also pushes the preferred network-IO mode from Posix-like to object-like. This paper will describe the prototype’s architecture and its design choices, the performance in high concurrent throughputs and file/object operations, failure modes and their handling, data recovery methods, and administration.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Alessi, Nicola, Carlo Caini, Tomaso de Cola, and Marco Raminella. "Packet Layer Erasure Coding in Interplanetary Links: The LTP Erasure Coding Link Service Adapter." IEEE Transactions on Aerospace and Electronic Systems 56, no. 1 (2020): 403–14. http://dx.doi.org/10.1109/taes.2019.2916271.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

MOHAMED, KHAIRI ASHOUR, and LÁSZLÓ PAP. "PERFORMANCE ANALYSIS OF FREQUENCY-HOPPED PACKET RADIO NETWORKS WITH SPATIALLY DISTRIBUTED USERS-COMBINED ERROR AND ERASURE DECODING CONSIDERED." Journal of Circuits, Systems and Computers 10, no. 03n04 (2000): 159–71. http://dx.doi.org/10.1142/s0218126600000123.

Texto completo

Resumen

This paper is concerned with the performance analysis of frequency-hopped packet radio networks with random spatial distribution of users. Depending on their relative energies, hits may either cause errors, erasures, or be ineffective. Combined error and erasure Reed Solomon decoding is used. Two types of hopping patterns are considered, namely random and one-coincidence patterns. Using a novel technique of the joint probability generating functions of the so called effective interference vectors, general closed form expressions for packet capture probabilities are derived. Numerical results indicate that, depending on the coding rate and traffic levels, larger values of the throughput can be achieved by using either error only or erasure only decoding.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Mohan, Lakshmi J., Pablo Ignacio Serrano Caneleo, Udaya Parampalli, and Aaron Harwood. "Geo-aware erasure coding for high-performance erasure-coded storage clusters." Annals of Telecommunications 73, no. 1-2 (2018): 139–52. http://dx.doi.org/10.1007/s12243-017-0623-2.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Gunasekaran, Dr S. "Erasure Coding in Multi-block Updates." International Journal for Research in Applied Science and Engineering Technology 7, no. 4 (2019): 372–78. http://dx.doi.org/10.22214/ijraset.2019.4066.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Guillen i Fabregas, A. "Coding in the Block-Erasure Channel." IEEE Transactions on Information Theory 52, no. 11 (2006): 5116–21. http://dx.doi.org/10.1109/tit.2006.883556.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Más fuentes

Tesis sobre el tema "Erasure Coding"

Demay, Gregory. "Source Coding for Erasure Channels." Thesis, KTH, Kommunikationsteori, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-55297.

Texto completo

Resumen

The main goal of this thesis is to bound the rate-distortion performance of the aforementioned sparse-graph codes for lossy compression of a BES. As our main contributions, we first derive lower bounds on the rate-distortion performance of LDGM codes for the BES, which are valid for any LDGM code of a given rate and generator node degree distribution and any encoding function. Our approach follows that of Kudekar and Urbanke, where lower bounds were derived for the BSS case. They introduced two methods for deriving lower bounds, namely the counting method and the test channel method. Based on numerical results they observed that the two methods lead to the same bound. We generalize these two methods for the BES and prove that indeed both methods lead to identical rate-distortion bounds for the BES and hence, also for the BSS. Secondly, based on the technique introduced by Martinian and Wainwright, we upper bound the rate-distortion performance of the check regular Poisson LDGM (CRP LDGM) ensemble and the compound LDGM-LDPC ensemble for the BES.We also show that there exist compound LDGM-LDPC codes, with degrees independent of the blocklength, which can achieve any given point on the Shannon rate-distortion curve of the BES.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Zeng, Weifei. "Coding and scheduling optimization over packet erasure broadcast channels." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/71501.

Texto completo

Resumen

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012. Cataloged from PDF version of thesis. Includes bibliographical references (p. 93-97). Throughput and per-packet delay can present strong trade-offs that are important in the cases of delay sensitive applications. In this thesis, we investigate such trade-offs using a random linear network coding scheme for one or more receivers in single hop wireless packet erasure broadcast channels. We capture the delay sensitivities across different types of network applications using a class of delay metrics based on the norms of packet arrival times. With these delay metrics, we establish a unified framework to characterize the rate and delay requirements of applications and optimize system parameters. In the single receiver case, we demonstrate the trade-off between average packet delay, which we view as the inverse of throughput, and maximum ordered inter-arrival delay for various system parameters. For a single broadcast channel with multiple receivers having different delay constraints and feedback delays, we jointly optimize the coding parameters and time-division scheduling parameters at the transmitters. We formulate the optimization problem as a Generalized Geometric Program (GGP). This approach allows the transmitters to adjust adaptively the coding and scheduling parameters for efficient allocation of network resources under varying delay constraints. In the case where the receivers are served by multiple non-interfering wireless broadcast channels, the same optimization problem is formulated as a Signomial Program, which is NP-hard in general. We provide approximation methods using successive formulation of geometric programs and show the convergence of approximations. Practical issues of implementing proposed coding and optimization scheme on existing layered network architecture are also discussed. by Weifei Zeng. S.M.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Childers, Thomas Edward. "File transfer with erasure coding over wireless sensor networks." Thesis, Monterey, Calif. : Naval Postgraduate School, 2009. http://edocs.nps.edu/npspubs/scholarly/theses/2009/Mar/09Mar%5FChilders.pdf.

Texto completo

Resumen

Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, March 2009. Thesis Advisors: McEachen, John ; Tummala, Murali. "March 2009." Description based on title screen as viewed on April 23, 2009. Author subject terms: Wireless Communication, Wireless Sensor Networks, Data Transmission. Includes bibliographical references (p. 81-82). Also available in print.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Le, Dang Quang. "Opportunistic multicasting scheduling using erasure-correction coding over wireless channels." Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=95215.

Texto completo

Resumen

In wireless communications, the broadcast nature can be explored to efficiently support multicast services while the difference in channel gains among the wireless links of users promotes multiuser diversity which can be used to improve multicast performance. This thesis proposes an opportunistic multicast scheduling scheme using erasure-correction coding to jointly exploit multicast gain, multiuser diversity, and time/frequency diversity in wireless communications. The proposed scheme sends only one copy to all users in the multicast group at a selected transmission threshold on time/frequency slots and using erasure-correction coding to recover erased packets when the instantaneous signal-to-noise ratio (SNR) of the link between the Base Station and a user is insufficient. On flat fading channel, an analytical framework is developed to establish the optimum selection of transmission threshold and erasure-correction code rate to achieve the best multicast throughput on different fading conditions. Numerical results show that the proposed scheme outperforms both the Worst-User and Best-User schemes for a wide range of SNR. The results also show that multiuser diversity is superior in the low SNR region while multicast gain is most significant at high SNR region. Moreover, to study the role of channel knowledge, the proposed scheme is considered in two cases: (i) with full channel gain knowledge and (ii) with only partial knowledge of fading type and average SNR. Our study indicates that full channel knowledge is beneficial for small multicast groups but at large group size it is sufficient to have partial channel knowledge as the difference in achievable throughput between the two cases is just marginal. The proposed scheme is further extended for applications to Orthogonal Frequency Division Multiplexing systems to take advantage of frequency diversity in a frequency-selective fading environment. Our study on the effect of frequency correlation on multicast thro Dans les communications sans-fil, la diffusion se prête naturellement aux services efficaces de multidiffusion tandis que les variations des gains de canal, parmi les liens avec les différents utilisateurs, permettent de promouvoir la diversité multiutilisateur qui peut être utilisée pour améliorer la performance de multidiffusion. Ce mémoire propose une méthode d'ordonnancement multidiffusion opportuniste en utilisant un code correcteur d'effacement pour exploiter conjointement le gain de multidiffusion ainsi que les diversités temporelle, spectrale et multiutilisateurs disponibles dans les communications sans fil. La méthode proposée n'envoie qu'une seule copie, sur les créneaux temporels et spectraux, à un seuil de transmission sélectionné pour tous les utilisateurs appartenant au groupe de multidiffusion et en utilisant un code correcteur d'effacement pour récupérer les paquets effacés lorsque le rapport signal sur bruit (SNR) instantané du lien entre Station de Base et un utilisateur est insuffisant. Sur un canal à évanouissement uniforme, un cadre analytique est développé pour établir la sélection optimale du seuil de transmission et le taux de codage à effacement pour atteindre le meilleur débit de multidiffusion sous l'effet de différentes conditions d'évanouissement. Les résultats numériques montrent que la méthode proposée surpasse en performance à la fois les méthodes Pire-Utilisateur et Meilleur-Utilisateur pour une ample plage de SNR. Les résultats montrent aussi que la diversité multiutilisateur est supérieure à bas SNR tandis que le gain multidiffusion est plus significatif à haut SNR. De plus, pour étudier le rôle de la connaissance du canal, la méthode proposée est considérée pour deux cas: (i) avec connaissance complète du canal et (ii) avec seulement une connaissance partielle du type d'évanouissement et SNR moyen. Notre étude indique que la connaissance complète du canal est avantageuse pour$

Los estilos APA, Harvard, Vancouver, ISO, etc.

Aitken, D. G. "Error control coding for mixed wireless and internet packet erasure channels." Thesis, University of Surrey, 2008. http://epubs.surrey.ac.uk/804436/.

Texto completo

Resumen

Recent years have seen dramatic growth in Internet usage and an increasing convergence between Internet and wireless communications. There has also been renewed interest in iteratively decoded low-density parity-check (LDPC) codes due to their capacity approaching performance on AWGN channels.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Liu, Chengjian. "ESetStore: an erasure-coding based distributed storage system with fast data recovery." HKBU Institutional Repository, 2018. https://repository.hkbu.edu.hk/etd_oa/507.

Texto completo

Resumen

The past decade has witnessed the rapid growth of data in large-scale distributed storage systems. Triplication, a reliability mechanism with 3x storage overhead and adopted by large-scale distributed storage systems, introduces heavy storage cost as data amount in storage systems keep growing. Consequently, erasure codes have been introduced in many storage systems because they can provide a higher storage efficiency and fault tolerance than data replication. However, erasure coding has many performance degradation factors in both I/O and computation operations, resulting in great performance degradation in large-scale erasure-coded storage systems. In this thesis, we investigate how to eliminate some key performance issues in I/O and computation operations for applying erasure coding in large-scale storage systems. We also propose a prototype named ESetStore to improve the recovery performance of erasure-coded storage systems. We introduce our studies as follows. First, we study the encoding and decoding performance of the erasure coding, which can be a key bottleneck with the state-of-the-art disk I/O throughput and network bandwidth. We propose a graphics processing unit (GPU)-based implementation of erasure coding named G-CRS, which employs the Cauchy Reed-Solomon (CRS) code, to improve the encoding and decoding performance. To maximize the coding performance of G-CRS by fully utilizing the GPU computational power, we designed and implemented a set of optimization strategies. Our evaluation results demonstrated that G-CRS is 10 times faster than most of the other coding libraries. Second, we investigate the performance degradation introduced by intensive I/O operations in recovery for large-scale erasure-coded storage systems. To improve the recovery performance, we propose a data placement algorithm named ESet. We define a configurable parameter named overlapping factor for system administrators to easily achieve desirable recovery I/O parallelism. Our simulation results show that ESet can significantly improve the data recovery performance without violating the reliability requirement by distributing data and code blocks across different failure domains. Third, we take a look at the performance of applying coding techniques to in-memory storage. A reliable in-memory cache for key-value stores named R-Memcached is designed and proposed. This work can be served as a prelude of applying erasure coding to in-memory metadata storage. R-Memcached exploits coding techniques to achieve reliability, and can tolerate up to two node failures. Our experimental results show that R-Memcached can maintain very good latency and throughput performance even during the period of node failures. At last, we design and implement a prototype named ESetStore for erasure-coded storage systems. The ESetStore integrates our data placement algorithm ESet to bring fast data recovery for storage systems.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Fang, Zhifei. "RTP Compatible: Two Models of Video Streaming Over VANETs." Thesis, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/31467.

Texto completo

Resumen

Because Vehicular Ad Hoc Networks (VANETs) often have a high packet loss rate, the formerly used protocol for video streaming, Real-time Transport Protocol (RTP), is no longer suitable for this specific environment. Previous conducted research has offered many new protocols to solve this problem; however, most of them cannot make full use of the existing Internet video streaming resources like RTP servers. Our work proposes two models to solve this compatibility issue. The first model is called the converter model. Based on this model, we first modify RTP using Erasure Coding (EC) technique in order to adapt it to the high packet loss rate of VANETs. This newly developed protocol is called EC-RTP. And, we then developed two converters. The first converter stands on the boundary between the Internet and VANETs. It receives the RTP packets which sent from Internet. And then it translates them to the EC-RTP packets. These packets are transported over the VANETs. The second converter receives these EC-RTP packets, translates them back to the RTP packets. It then sends them to the RTP player, so that the RTP player can play these packets. To make EC-RTP can carry more kinds of video streams other than RTP, we proposed a second model. The second model is called the redundancy tunnel. Based on this model, we let the protocol between the two converters carry RTP protocol as its payload. We use the same technique as we have used to modify RTP. At last, we did some experiments with Android tablets. The experiment results show our solution can use the same player to play the same video resources as RTP does. However, unlike RTP, it can reduce packet loss rate.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Rajana, Poojitha. "Performance Evaluation of Gluster and Compuverde Storage Systems : Comparative analysis." Thesis, Blekinge Tekniska Högskola, Institutionen för kommunikationssystem, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-13595.

Texto completo

Resumen

Context. Big Data and Cloud Computing nowadays require large amounts of storage that are accessible by many servers. To overcome the performance bottlenecks and single point of failure distributed storage systems came into force. So, our main aim in this thesis is evaluating the performance of these storage systems. A file coding technique is used that is the erasure coding which will help in data protection for the storage systems. Objectives. In this study, we investigate the performance evaluation of distributed storage system and understand the effect on performance for various patterns of I/O operations that is the read and write and also different measurement approaches for storage performance. Methods. The method is to use synthetic workload generator by streaming and transcoding video data as well as benchmark tool which generates the workload like SPECsfs2014 is used to evaluate the performance of distributed storage systems of GlusterFS and Compuverde which are file based storage. Results. In terms of throughput results, Gluster and Compuverde perform similar for both NFS and SMB server. The average latency results for both NFS and SMB shares indicate that Compuverde has lower latency. When comparing results of both Compuverde and Gluster, Compuverde delivers 100% IOPS with NFS server and Gluster delivers relatively near to the requested OP rate and with SMB server Gluster delivers 100% IOPS and Compuverde delivers more than the requested OP rate.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Heindlmaier, Michael [Verfasser]. "Network Coding for Two-Way Relay Channels and Broadcast Erasure Channels with Feedback / Michael Heindlmaier." München : Verlag Dr. Hut, 2015. http://d-nb.info/1080754334/34.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Grohsschmiedt, Steffen. "Making Big Data Smaller : Reducing the storage requirements for big data with erasure coding for Hadoop." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-177201.

Texto completo

Resumen

The amount of data stored in modern data centres is growing rapidly nowadays. Large-scale distributed file systems, that maintain the massive data sets in data centres, are designed to work with commodity hardware. Due to the quality and quantity of the hardware components in such systems, failures are considered normal events and, as such, distributed file systems are designed to be highly fault-tolerant. A common approach to achieve fault tolerance is using redundancy by storing three copies of a file across different storage nodes, thereby increasing the storage requirements by a factor of three and further aggravating the storage problem. A concrete implementation of such a file system is the Hadoop Distributed File System (HDFS). This thesis explores the use of RAID-like mechanisms in order to decrease the storage requirements for big data. We designed and implemented a prototype that extends HDFS with a simple but powerful erasure coding API. Compared to existing approaches, we decided to locate the erasure-coding management logic in the HDFS NameNode, as this allows us to use internal HDFS APIs and state. Because of that, we can repair failures associated with erasurecoded files more quickly and with lower cost. We evaluate our prototype, and we also show that the use of erasure coding instead of replication can greatly decrease the storage requirements of big data without scarifying reliability and availability. Finally, we argue that our API can support a large range of custom encoding strategies, while adding the erasure coding logic to the NameNode can significantly improve the management of the encoded files.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Más fuentes

Libros sobre el tema "Erasure Coding"

Hernandez, Marco. The Erasure of the Afro Element of Mestizaje in Modern Mexico: The Coding of Visibly Black Mestizos According to a White Aesthetic in and Through the Discourse ... During the Cultural Phase of the Mexican. Dissertation.Com., 2002.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Investigation of the use of erasures in a concatenated coding scheme: Technical report. Dept. of Electrical Engineering, College of Engineering, University of Toledo, 1997.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Zubairy, M. Suhail. Quantum Mechanics for Beginners. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198854227.001.0001.

Texto completo

Resumen

Quantum mechanics is a highly successful yet a mysterious theory. Quantum Mechanics for Beginners provides an introduction of this fascinating subject to someone with only a high school background in physics and mathematics. This book, except the last chapter on the Schrödinger equation, is entirely algebra-based. A major strength of this book is that, in addition to the foundation of quantum mechanics, it provides an introduction to the fields of quantum communication and quantum computing. The topics covered include wave–particle duality, the Heisenberg uncertainty relation, Bohr’s principle of complementarity, quantum superposition and entanglement, Schrödinger’s cat, Einstein–Podolsky–Rosen paradox, Bell theorem, quantum no-cloning theorem and quantum copying, quantum eraser and delayed choice, quantum teleportation, quantum key distribution protocols such as BB-84 and B-92, counterfactual communication, quantum money, quantum Fourier transform, quantum computing protocols including Shor and Grover algorithms, quantum dense coding, and quantum tunneling. All these topics and more are explained fully but using only elementary mathematics. Each chapter is followed by a short list of references and some exercises. This book is meant for an advanced high school student and a beginning college student and can be used as a text for a one semester course at the undergraduate level. However it can also be a useful and accessible book for those who are not familiar but want to learn some of the fascinating recent and ongoing developments in areas related to the foundations of quantum mechanics and its applications to quantum communication and quantum computing.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Capítulos de libros sobre el tema "Erasure Coding"

Dumer, Ilya I., and Patrick G. Farrell. "Erasure correction performance of linear block codes." In Algebraic Coding. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-57843-9_32.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Silberstein, Natalia. "Fractional Repetition and Erasure Batch Codes." In Coding Theory and Applications. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17296-5_36.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Beemer, Allison, Carolyn Mayer, and Christine A. Kelley. "Erasure Correction and Locality of Hypergraph Codes." In Coding Theory and Applications. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66278-7_3.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Climent, Joan-Josep, Diego Napp, Raquel Pinto, and Rita Simões. "Burst Erasure Correction of 2D Convolutional Codes." In Coding Theory and Applications. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17296-5_11.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Cardell, Sara D., and Joan-Josep Climent. "SPC Product Codes over the Erasure Channel." In Coding Theory and Applications. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17296-5_8.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Schmidt, Georg, Vladimir R. Sidorenko, and Martin Bossert. "Error and Erasure Correction of Interleaved Reed–Solomon Codes." In Coding and Cryptography. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11779360_3.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Haddock, Walker, Matthew L. Curry, Purushotham V. Bangalore, and Anthony Skjellum. "GPU Erasure Coding for Campaign Storage." In Lecture Notes in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-67630-2_13.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Weatherspoon, Hakim, and John D. Kubiatowicz. "Erasure Coding Vs. Replication: A Quantitative Comparison." In Peer-to-Peer Systems. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45748-8_31.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Rodrigues, Rodrigo, and Barbara Liskov. "High Availability in DHTs: Erasure Coding vs. Replication." In Peer-to-Peer Systems IV. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11558989_21.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Massri, Khalil, Roberto Beraldi, and Andrea Vitaletti. "Erasure-Coding Based Data Delivery in Delay Tolerant Networks." In Internet of Things, Smart Spaces, and Next Generation Networking. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40316-3_17.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Actas de conferencias sobre el tema "Erasure Coding"

Gan, Yiwei, Zhijie Huang, Yulong Shi, Xiao Zhang, and Nannan Zhao. "Erasure Coding Based Optimization in Decentralized Distributed Storage Systems." In 2024 International Conference on Networking, Architecture and Storage (NAS). IEEE, 2024. https://doi.org/10.1109/nas63802.2024.10781352.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Tseng, Lewis. "Erasure Coding in Object Stores." In PODC '18: ACM Symposium on Principles of Distributed Computing. ACM, 2018. http://dx.doi.org/10.1145/3212734.3212799.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Chen, Hsing-bung, and Song Fu. "Parallel Erasure Coding: Exploring Task Parallelism in Erasure Coding for Enhanced Bandwidth and Energy Efficiency." In 2016 IEEE International Conference on Networking, Architecture and Storage (NAS). IEEE, 2016. http://dx.doi.org/10.1109/nas.2016.7549412.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Sarshar, Nima, Xiaolin Wu, and Zhe Wang. "Optimal Multicast with Erasure Correction Coding." In 2006 IEEE Information Theory Workshop. IEEE, 2006. http://dx.doi.org/10.1109/itw.2006.322851.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Sarshar, Nima, Xiaolin Wu, and Zhe Wang. "Optimal Multicast with Erasure Correction Coding." In 2006 IEEE Information Theory Workshop - ITW '06 Chengdu. IEEE, 2006. http://dx.doi.org/10.1109/itw2.2006.323833.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Charles, Denis, and Sidd Puri. "Hierarchical Erasure coding for P2P storage." In 2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PacRim). IEEE, 2009. http://dx.doi.org/10.1109/pacrim.2009.5291245.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Zhao, S., D. Tuninetti, R. Ansari, and D. Schonfeld. "Multiple Description Coding over Erasure Channels." In 2008 IEEE International Conference on Communications. IEEE, 2008. http://dx.doi.org/10.1109/icc.2008.354.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Leong, Derek, and Tracey Ho. "Erasure coding for real-time streaming." In 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6284055.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Tekin, Omer Faruk, Tracey Ho, Hongyi Yao, and Sidharth Jaggi. "On erasure correction coding for streaming." In 2012 Information Theory and Applications Workshop (ITA). IEEE, 2012. http://dx.doi.org/10.1109/ita.2012.6181798.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Cho, Wan Hee, and Anwitaman Datta. "Elastic Erasure Coding for Adaptive Redundancy." In 2016 IEEE 36th International Conference on Distributed Computing Systems Workshops (ICDCSW). IEEE, 2016. http://dx.doi.org/10.1109/icdcsw.2016.23.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Informes sobre el tema "Erasure Coding"

Kuhn, N., E. Lochin, F. Michel, and M. Welzl. Forward Erasure Correction (FEC) Coding and Congestion Control in Transport. RFC Editor, 2022. http://dx.doi.org/10.17487/rfc9265.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Egan, William Douglas, Samuel William Coome, and Cheng Chen. Performance Studies of Parallel Erasure Coding on Clustered Micro Storage Servers. Office of Scientific and Technical Information (OSTI), 2016. http://dx.doi.org/10.2172/1296651.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Betsworth, Jacob. Analyzing erasure coding for the SmartSSD: a deep dive of Jerasure. Iowa State University, 2023. http://dx.doi.org/10.31274/cc-20240624-212.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!