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 9 of 9 for “"AG codes"”.

  1. Algebraic geometric codes on anticanonical surfaces

    Algebraic geometric codes (or AG codes) provide a way to correct errors that occur during the transmission of digital information. AG codes on curves have been studied extensively, but much less work has been done for AG codes on higher dimensional varieties. In particular, we seek good bounds for …

    nebraska Repository record for Algebraic geometric codes on anticanonical surfaces (opens in a new tab)

  2. Quantum Algebraic Geometry Codes

    … theory, providing protection for quantum states against noise and decoherence. This thesis investigates the construction of quantum error correction codes derived from classical algebraic geometry (AG) codes. We present two distinct construction techniques, highlighting the flexibility and …

    rice Repository record for Quantum Algebraic Geometry Codes (opens in a new tab) Embargoed until 2030-12-01

  3. Algebraic methods for secure coded computing

    … coding theory, namely algebraic geometry (AG) codes. These codes are constructed by taking evaluation vectors of rational functions on an algebraic curve. Due to their algebraic structure, AG codes behave nicely under coordinatewise multiplication, which makes them ideal for constructing …

    aalto Repository record for Algebraic methods for secure coded computing (opens in a new tab)

  4. Invariant embeddings of the Deligne-Lusztig curves with applications

    … $\GG$ with applications in algebraic geometry codes, hash families, and polar codes. This thesis consists of four parts, the first part presents our result in finding smooth embeddings for the Deligne-Lusztig curves in projective space. The second part concerns certain Riemann-Roch spaces and …

    uiuc Repository record for Invariant embeddings of the Deligne-Lusztig curves with applications (opens in a new tab)

  5. Improved Bounds for Codes and Secret Sharing Schemes from Algebraic Curves

    … theoretic constructions of error-correcting codes and secret sharing schemes. For both objects we define parameters that indicate their effectiveness in applications. We explore infeasibility bounds, showing that objects with relatively high parameters cannot exist. The best upper bounds in …

    uiuc Repository record for Improved Bounds for Codes and Secret Sharing Schemes from Algebraic Curves (opens in a new tab)

  6. Two problems in the theory of curves over fields of positive characteristic

    … half is about the coding theory. For a full flag of codes, if it is equivalent to its duals, then it is said to have the isometry-dual property. Introducing characterizations of isometry-dual property for one-point AG codes and its preservation after puncturing at some points, some …

    uiuc Repository record for Two problems in the theory of curves over fields of positive characteristic (opens in a new tab)

  7. Intersections of Algebraic Curves and their link to the weight enumerators of Algebraic-Geometric Codes

    … techniques. Nowadays, the best performing linear codes are known to be mostly algebraic geometry codes, also named Goppa codes, which arise from an algebraic curve over a finite field, by the pioneering construction due to V. D. Goppa. The best choices for curves on which Goppa's construction and …

    trento Repository record for Intersections of Algebraic Curves and their link to the weight enumerators of Algebraic-Geometric Codes (opens in a new tab) Restricted access

  8. DECODING OF MULTIPOINT ALGEBRAIC GEOMETRY CODES VIA LISTS

    Algebraic geometry codes have been studied greatly since their introduction by Goppa . Early study had focused on algebraic geometry codes CL(D;G) where G was taken to be a multiple of a single point. However, it has been shown that if we allow G to be supported by more points, then the associated …

    clemson Repository record for DECODING OF MULTIPOINT ALGEBRAIC GEOMETRY CODES VIA LISTS (opens in a new tab)

  9. Error correcting codes: local testing, list decoding, and applications

    … is a study of special types of error correcting codes and their applications. It consists of three parts. First, we study Generalized Reed-Muller codes (over prime fields), aka low-degree polynomials. Specifically, we show that these codes are locally testable. Locally testable codes are a class …

    texas Repository record for Error correcting codes: local testing, list decoding, and applications (opens in a new tab)