A construction of t-fold perfect splitting authentication codes with equal deception probabilities
Orthogonal multi-arrays were first formulated by Brickell in investigation of authentication codes. In this article, we will prove that t-fold perfect splitting authentication codes with equal deception probabilities can be characterized in terms of orthogonal multi-arrays. We will also investigate the existence of orthogonal multi-arrays, and show that the existence of orthogonal multi-arrays OMA (t,kc,n)s is equivalent to the existence of transversal splitting t-designs splitting TD (t,kc,n)s. Further, we obtain some new infinite classes of t-fold perfect splitting authentication codes with equal deception probabilities.
t-fold perfect splitting authentication code orthogonal multi-array transversal splitting t-design 05b15 94a62