A decoding algorithm for algebraic-geometric codes arising from arbitrary algebraic curves is presented. This algorithm corrects any number of errors up to ...
scholar.google.com › citations
This talk is intended to give a survey on the existing literature on the decoding of algebraic-geometric codes. Although the motivation originally was to ...
A first attempt to decode algebraic-geometric codes was made by Driencourt [15] for codes on elliptic curves. This algorithm corrects b(δΓ − 1)/4c errors. At ...
This work was presented at the International Workshop on Algebraic and. Combinatorial Coding Theory, Varna, Bulgaria, September 18-24, 1988. A. N. Skorobogatov ...
PDF | This paper provides a survey of the existing literature on the decoding of algebraic-geometric codes. Definitions, theorems, and cross references.
A decoding algorithm for algebraic-geometric codes arising from arbitrary algebraic curves is presented. This algorithm corrects any number of errors up to ...
In this paper, a decoding algorithm based on Fundamental Iterative Algorithm(FIA) is presented, also its reasonableness is proved. In fact, our decoding ...
This talk is intended to give a survey on the existing literature on the decoding of algebraic-geometric codes. Although the motivation originally was to ...
We introduce now one of the easiest decoding methods for linear codes, called syndrome methods. Let C be a [n, k]-code with control matrix H. The syndrome of x ...
A decoding algorithm for BCH codes is the Berlekamp-Massey algorithm. This algorithm has complexity O(n^2) and provides a general solution to the problem of ...