[1] SIMMONS G J. Authentication theory/decoding theory[J]. Lecture Notes in Computer Science，1985，96：411-431.[2] LIANG M，DU B L. A new class of 3-fold perfect splitting authenticationcodes[J].DesignCodesCryptography，2012，62：109-119.[3] CHEN S D，ZHAO D W. Construction of multi-receiver multi-fold authentication codes from singular sympletic geometry over finite fields[J].Algebra Colloquium，2013，20（4）：701-710.[4] CHEN S D，ZHAO D W. New construction of authentication codes with arbitration from pseudo-sympletic geometry over finite fields[J]. Ars Combinatoria，2010，97（A）：453-465.[5] GAO Y，LIU Y Q. The construction of A3-code from projective spaces over finite fields[J]. WSEAS Transactions on Mathematics，2013，12（10）：1024-1033.[6] SIMMONS G J. A game theory model of digital message authentication[J]. Congr Numer，1982，34：413-424.[7] KUROSAWA K，OBANA S. Combinatorial bounds on authentication codes with arbitration[J]. Designs Codes Cryptography，2001，22：265-281.[8] 王永传，杨义先.分裂认证码与纠错码[J]. 通信保密，1999，77（1）：64-66.[9] HUBER M. Combinatorial bounds and characterizations of splitting authentication codes[J]. Cryptography and Communications，2010，2：173-185.[10] WAN Z X. Geometry of Classical Groups over Finite Fields[M]. 2nd ed.Beijing：Science Press，2002.
