GOB designs for authentication codes with arbitration |
| |
Authors: | Gennian Ge Ying Miao L Zhu |
| |
Institution: | (1) Department of Mathematics, Zhejiang University, Hangzhou, 310027, Zhejiang, P. R. China;(2) Department of Social Systems and Management, Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba 305-8573, Japan;(3) Department of Mathematics, Suzhou University, Suzhou, 215006, Jiangsu, P. R. China |
| |
Abstract: | Combinatorial characterization of optimal authentication codes with arbitration was previously given by several groups of
researchers in terms of affine α-resolvable + BIBDs and α-resolvable designs with some special properties, respectively.
In this paper, we revisit this known characterization and restate it using a new idea of GOB designs. This newly introduced
combinatorial structure simplifies the characterization, and enables us to extend Johansson’s well-known family of optimal
authentication codes with arbitration to any finite projective spaces with dimension greater than or equal to 3. |
| |
Keywords: | Authentication code with arbitration Combinatorial characterization GOB design Optimal |
本文献已被 SpringerLink 等数据库收录! |
|