Combinatorial characterizations of authentication codes. II
From MaRDI portal
Recommendations
Cited in
(19)- Коды аутентификации с секретностью (обзор)
- A New Authentication System Based on the Generalized Affine Planes
- Combinatorial bounds and characterizations of splitting authentication codes
- scientific article; zbMATH DE number 7310202 (Why is no real title available?)
- On the equivalence of authentication codes and robust (2, 2)-threshold schemes
- Authentication codes based on resilient Boolean maps
- Three constructions of authentication/secrecy codes
- Logarithm Cartesian authentication codes.
- Complete weight enumerators of some linear codes and their applications
- Isomorphism classes of authentication codes
- An extension of authentication codes based on BIBDs
- New constructions of systematic authentication codes from three classes of cyclic codes
- Combinatorial characterizations of authentication codes
- A coding theory construction of new systematic authentication codes
- scientific article; zbMATH DE number 176540 (Why is no real title available?)
- Authentication codes and bipartite graphs
- scientific article; zbMATH DE number 1024097 (Why is no real title available?)
- Complete weight enumerator for a class of linear codes from defining sets and their applications
- Cartesian authentication codes from functions with optimal nonlinearity.
This page was built for publication: Combinatorial characterizations of authentication codes. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910435)