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

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

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

    … 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 generalizations in …

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

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

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