Skip to main content
Conference ProceedingsOPEN ACCESS

Combinatorial characterizations of authentication codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 576 LNCS 62-73
DOI: 10.1007/3-540-46766-1_4
18Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we prove two new combinatorial characterizations of authentication codes. Authentication codes without secrecy are characterized in terms of orthogonal arrays; and general authentication codes are characterized in terms of balanced incomplete block designs.

Cite

CITATION STYLE

APA

Stinson, D. R. (1992). Combinatorial characterizations of authentication codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 576 LNCS, pp. 62–73). Springer Verlag. https://doi.org/10.1007/3-540-46766-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free