Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 22 for “"MDS codes"”.

  1. Coding Schemes for Distributed Storage Systems

    … is devoted to problems in error-correcting codes motivated by data integrity problems arising in large-scale distributed storage systems. We study properties and constructions of Maximum Distance Separable (MDS) codes, which are widely used in storage applications since they provide the …

    maryland Repository record for Coding Schemes for Distributed Storage Systems (opens in a new tab)

  2. Empirical analysis of using erasure coding in outsourcing data storage with provable security

    … this work, we study maximum distance separable (MDS) codes as the underlying tools providing recoverability for POR. We survey MDS codes and select Reed-Solomon and Cauchy Reed-Solomon MDS codes to be implemented into a prototype POR library. We use the liberasurecode library to evaluate multiple …

    nps Repository record for Empirical analysis of using erasure coding in outsourcing data storage with provable security (opens in a new tab)

  3. Improve the Performance and Scalability of RAID-6 Systems Using Erasure Codes

    … level of reliability with the support of erasure codes. Among many implementations, one class of codes called Maximum Distance Separable (MDS) codes aims to offer data protection against disk failures with optimal storage efficiency. Typical MDS codes contain horizontal and vertical codes. …

    vcu Repository record for Improve the Performance and Scalability of RAID-6 Systems Using Erasure Codes (opens in a new tab)

  4. Rate adaptive coding and its application to spread spectrum communications

    … based on punctured maximum distance separable (MDS) codes. For this scheme, the throughput and codeword error probability verses the code symbol error probability are derived. The performance of this protocol is also analyzed in a Rayleigh fading environment, with the maximum number of …

    uvic Repository record for Rate adaptive coding and its application to spread spectrum communications (opens in a new tab)

  5. Computational Methods for Classification of Codes

    … classification and existence problems involving codes and covering arrays, which are mathematically related to codes and used for example in designing tests for systems such as software. The algorithms make use of common techniques for exhaustive generation and isomorph rejection. The new methods …

    aalto Repository record for Computational Methods for Classification of Codes (opens in a new tab)

  6. Enabling Private Real-Time Applications by Exploiting the Links Between Erasure Coding and Secret Sharing Mechanisms

    … channel, commonly improved by using erasure codes. In this thesis, we bring together the theoretically related fields of secret sharing and erasure coding, to provide a rich source of solutions to the two problem areas. Our aim is to enable solutions that deliver the required performance …

    unsw Repository record for Enabling Private Real-Time Applications by Exploiting the Links Between Erasure Coding and Secret Sharing Mechanisms (opens in a new tab)

  7. Bounds on codes from smooth toric threefolds with rank(pic(x)) = 2

    … and do not generate maximum distance separable (MDS) codes and Almost-MDS codes. In 2006, Little and Schenck gave formulas for the minimum distance of certain toric codes corresponding to smooth toric surfaces with rank(Pic(X)) = 2 and rank(Pic(X)) = 3. Additionally, they gave upper and lower …

    tamu Repository record for Bounds on codes from smooth toric threefolds with rank(pic(x)) = 2 (opens in a new tab)

  8. Automorphism Groups of Geometric Codes

    The aim of this thesis is to study geometric codes over algebraic curves and their automorphism groups. In particular, we are interested in the relation between the automorphism group of the code and the automorphism group of the curve from which it originates. The first problem we study concerns …

    east-anglia Download PDF for Automorphism Groups of Geometric Codes (opens in a new tab)

  9. Byzantine-tolerant erasure coding for blockchains

    … Aurora utilizes Maximum Distance Separable (MDS) codes paired with vector commitments like KZG, optimizing for robust data redundancy and secure verification processes. Phoenix, conversely, leverages rateless codes alongside homomorphic commitments, offering greater flexibility and efficiency …

    ubc Repository record for Byzantine-tolerant erasure coding for blockchains (opens in a new tab) Download PDF for Byzantine-tolerant erasure coding for blockchains (opens in a new tab)

  10. Variable Packet-Error Coding

    … performance of the code, in this work, codes are designed to enable the decoder to reproduce the source subject to a certain distortion constraint when there are no packets errors, subject to a less stringent distortion constraint when there is one error, etc. The topic of this thesis is …

    cornell Repository record for Variable Packet-Error Coding (opens in a new tab)

  11. A study of correlation-immune, resilient and related cryptographic functions

    … pattern testing of VLSI chips, authentication codes, universal hash functions, threshold schemes, and perfect local randomisers. This dissertation is a study of correlation-immune and resilient functions from a combinatorial point of view, emphasizing their connections to orthogonal arrays. An …

    nebraska Repository record for A study of correlation-immune, resilient and related cryptographic functions (opens in a new tab)

  12. Private Computation for Machine Learning Applications

    … theory, such as Maximum Distance Separable (MDS) codes, and interference alignment. In addition, we briefly discuss the PLT settings in which the user has a prior side information about the dataset, and propose novel PLT schemes to show the advantages of side information in reducing the …

    tamu Repository record for Private Computation for Machine Learning Applications (opens in a new tab)

  13. Random access for massive machine-type communications

    … distributions for CSA schemes with repetition codes and maximum distance separable (MDS) codes to maximize the expected traffic load, under packet erasure channels and slot erasure channels. We derive the asymptotic throughput of the CSA schemes over the erasure channels for an infinite frame …

    unsw Repository record for Random access for massive machine-type communications (opens in a new tab)

  14. Diversity and Reliability in Erasure Networks: Rate Allocation, Coding, and Routing

    … It is proved that Maximum Distance Separable (MDS) codes achieve the minimum probability of error over any erasure channel (with or without memory). Chapter 4 addresses a fundamental trade-off between rate and diversity gain of an end-to-end connection in erasure networks. We prove that there …

    waterloo Repository record for Diversity and Reliability in Erasure Networks: Rate Allocation, Coding, and Routing (opens in a new tab)

  15. Erasure Coding Optimization for Data Storage: Acceleration Techniques and Delayed Parities Generation

    … even compete against well-known but less general codes such as EVENODD, RDP, and STAR codes. One particularly important observation is that vectorizing the XOR operations is a better choice than directly vectorizing finite field operations, not only because of the flexibility in choosing finite …

    tamu Repository record for Erasure Coding Optimization for Data Storage: Acceleration Techniques and Delayed Parities Generation (opens in a new tab)

  16. Private Information Read-Update-Write with Applications to Distributed Learning

    … for semantic PIR with replicated databases, MDS coded databases and colluded databases. As PIR deals with private \emph{reading}, we consider private \emph{writing} in the second work, which is an immediate conceptual extension of PIR. In the problem of private read-update-write (PRUW), a …

    maryland Repository record for Private Information Read-Update-Write with Applications to Distributed Learning (opens in a new tab)

  17. Energy Harvesting Communication Networks: Online Policies, Temperature Considerations, and Age of Information

    … of channel coding: maximum distance separable (MDS) codes and rateless erasure codes. For each of these models, we study two achievable schemes: best-effort and save-and-transmit. We analyze the average AoI under each of these policies. We show that rateless coding with save-and-transmit …

    maryland Repository record for Energy Harvesting Communication Networks: Online Policies, Temperature Considerations, and Age of Information (opens in a new tab)

  18. Binary Ldpc Design For Slepian-wolf Coding Of Correlated Information Sources

    … is understood from Shannon’s theory that block codes of sufficiently large length are asymptotically optimal. This justifies the use of binary channel codes like Low-Density Parity-Check (LDPC) codes for practical Slepian-Wolf coding. Thus, LDPC codes of block lengths n=512, 100 and 1024 were …

    plymouth Repository record for Binary Ldpc Design For Slepian-wolf Coding Of Correlated Information Sources (opens in a new tab)

Page 1 of 2