Exponential sums over Galois rings have many applications in coding theory, cryptography and algebraic combinatorics. In this article, we employ additive characters and multiplicative characters over Galois rings to present two classes of codebooks, and prove that these codebooks asymptotically achieve the Welch bound. In addition, the resulting codebooks have new parameters.
