Encoding of codes on curves

Decoders for algebraic geometry codes on curves have been studied in several places. The article considers the question of encoding data. The encoders are immediately consistent with the parity-check formulation of the codes rather than the generation matrix formulation. Two distinct techniques are described. In the first method, the algebraic geometry code is described as a linear combination of Reed-Solomon codes. The second, uses methods of signal processing and the two-dimensional Fourier transforms to relate the encoder and the decoder.<>