Combinatorial characterizations of authentication codes. II

zbMath0853.94019MaRDI QIDQ1910435

R. S. Rees, Douglas R. Stinson

Publication date: 4 June 1996

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

extremal codeauthentication codesymmetric balanced incomplete block designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (14)

Authentication codes based on resilient Boolean maps ⋮ Complete weight enumerators of some linear codes and their applications ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ Complete weight enumerator for a class of linear codes from defining sets and their applications ⋮ Logarithm Cartesian authentication codes. ⋮ Cartesian authentication codes from functions with optimal nonlinearity. ⋮ Complete weight enumerators of two classes of linear codes ⋮ Authentication codes and bipartite graphs ⋮ A coding theory construction of new systematic authentication codes ⋮ Three constructions of authentication/secrecy codes ⋮ New constructions of systematic authentication codes from three classes of cyclic codes ⋮ On the equivalence of authentication codes and robust (2, 2)-threshold schemes ⋮ Коды аутентификации с секретностью (обзор) ⋮ Unnamed Item

This page was built for publication: Combinatorial characterizations of authentication codes. II