论文部分内容阅读
Two authentication codes with arbitration (A2-codes) are constrructed from finite affine spaces to illustrate for the first time that the information-theoretic lower bounds for A2-codes can be strictly tighter than the combinatorial ones. The codes also i