We present an introduction to the theory of algebraic geometry codes. Starting from evaluation codes and codes from order and weight functions, special attention is given to one-point codes and, in particular, to the family of Castle codes.
For stegoschemes arising from error correcting codes, embedding depends on a decoding map for the corresponding code. As decoding maps are usually not complete, embedding can fail. We propose a method to ensure or increase the probability of embeddin
g success for these stegoschemes. This method is based on puncturing codes. We show how the use of punctured codes may also increase the embedding efficiency of the obtained stegoschemes.
