Abstract
With the right length of the shared key the steganography method based on the error-correcting codes is perfectly secure. By modifying the part of the codeword of the Reed-Solomon codes according to the error map we can embed the secret information into the RS codeword as there is a mapping code between secret information and codeword error map. The steganography capacity of the RS codes is dependent upon its parameter of the codeword and the codeword error map that attend to the information hiding. In this paper we would present some algorithms that calculate the steganography capacity of RS codes.