Three constructions of authentication/secrecy codes

In this paper, we present three algebraic constructions of authentication codes with secrecy. The codes have simple algebraic structures and are easy to implement. They are asymptotically optimal with respect to certain bounds.