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 4 of 4 for “"Cartesian codes"”.

  1. Repairing Cartesian Codes with Linear Exact Repair Schemes

    … scheme to recover a single erasure when using a Cartesian code,in the context of a distributed storage system. Particularly, we develop a scheme withconsiderations to minimize the associated bandwidth and maximize the associateddimension. The problem of recovering a missing node's data exactly in …

    vt Repository record for Repairing Cartesian Codes with Linear Exact Repair Schemes (opens in a new tab)

  2. Linear Exact Repair Schemes for Distributed Storage and Secure Distributed Matrix Multiplication

    … repair schemes utilizing decreasing monomial-Cartesian codes (DMC codes). Specifically, we construct novel DMC codes in the form of augmented Cartesian codes and rectangular monomial-Cartesian codes, as well as design exact repair schemes utilizing these constructions inspired by the schemes …

    vt Repository record for Linear Exact Repair Schemes for Distributed Storage and Secure Distributed Matrix Multiplication (opens in a new tab)

  3. Algebraic coding theory for private information retrieval

    … multi-server PIR protocols using binary cyclic codes. We construct PIR schemes with improved privacy guarantees by carefully selecting storage and retrieval codes with optimal or near-optimal parameters, comparing our schemes with known Reed–Muller-based constructions. Afterward, the thesis …

    valladolid Repository record for Algebraic coding theory for private information retrieval (opens in a new tab)

  4. Codes and Sequences for Information Retrieval and Stream Ciphers

    Given a self-similar structure in codes and de Bruijn sequences, recursive techniques may be used to analyze and construct them. Batch codes partition the indices of code words into m buckets, where recovery of t symbols is accomplished by accessing at most tau in each bucket. This finds use in the …

    clemson Repository record for Codes and Sequences for Information Retrieval and Stream Ciphers (opens in a new tab)