Three constructions of perfect authentication codes from projective geometry over finite fields

We construct perfect authentication codes from the projective geometry over finite fields. There are three major constructions. The first construction is a perfect authentication code with splitting, the second construction is a perfect authentication codes with arbitration, and the third construction is a perfect authentication code without arbitration which is an extension of the second construction. Their parameters and probabilities of successful attacks are computed.