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 “"algebraic geometry codes"”.

  1. Quantum Algebraic Geometry Codes

    … the construction of quantum error correction codes derived from classical algebraic geometry (AG) codes. We present two distinct construction techniques, highlighting the flexibility and self-orthogonality of AG codes, and demonstrate their ability to produce asymptotically good quantum codes. …

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

  2. 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)

  3. Bases and applications of Riemann-Roch Spaces of Function Fields with Many Rational Places

    Algebraic geometry codes are generalizations of Reed-Solomon codes, which are implemented in nearly all digital communication devices. In ground-breaking work, Tsfasman, Vladut, and Zink showed the existence of a sequence of algebraic geometry codes that exceed the Gilbert-Varshamov bound, which …

    clemson Repository record for Bases and applications of Riemann-Roch Spaces of Function Fields with Many Rational Places (opens in a new tab)

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

    … can occur in data transmitted through a channel. Algebraic Coding Theory is the part of Channel Coding which studies the possibility to detect and correct errors using algebraic and geometric techniques. Nowadays, the best performing linear codes are known to be mostly algebraic geometry codes, …

    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

  5. Algebraic Codes For Error Correction In Digital Communication Systems

    … the notion of using error correcting codes to mitigate the effects of noise in digital transmission was introduced by R. Hamming. Algebraic codes, codes described using powerful tools from algebra took to the fore early on in the search for good error correcting codes. Many classes of …

    plymouth Repository record for Algebraic Codes For Error Correction In Digital Communication Systems (opens in a new tab)

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

    … $\AAA$, $\BB$, and $\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 …

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

  7. Codes from norm-trace curves: local recovery and fractional decoding

    Codes from curves over finite fields were first developed in the late 1970's by V. D. Goppa and are known as algebraic geometry codes. Since that time, the construction has been tailored to fit particular applications, such as erasure recovery and error correction using less received information …

    vt Repository record for Codes from norm-trace curves: local recovery and fractional decoding (opens in a new tab)

  8. Graph-based and algebraic codes for error-correction and erasure recovery

    Expander codes are sparse graph-based codes with good decoding algorithms. We present a linear-time decoding algorithm for (C,D, alpha, gamma) expander codes based on graphs with any expansion factor given that the minimum distances of the inner codes are bounded below. We also design graph-based …

    vt Repository record for Graph-based and algebraic codes for error-correction and erasure recovery (opens in a new tab)

  9. Automorphisms of Hermitian Codes and Applications

    … and local correctability can all benefit from codes with rich automorphism groups. Rigid codes, or codes that have a trivial automorphism group, are also interesting, mainly for applications to code-based post-quantum cryptography. It has been shown that, with high probability, a random linear …

    vt Repository record for Automorphisms of Hermitian Codes and Applications (opens in a new tab)