Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6007753 (Why is no real title available?)
- scientific article; zbMATH DE number 1789703 (Why is no real title available?)
- scientific article; zbMATH DE number 949739 (Why is no real title available?)
- A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM ORTHOGONAL SPACES OVER A FINITE FIELD OF ODD CHARACTERISTIC
- Authentication codes and bipartite graphs
- Codes Which Detect Deception
- Linear authentication codes: bounds and constructions
- The combinatorics of authentication and secrecy codes
- Two constructions of multireceiver authentication codes from symplectic geometry over finite fields
- Two new constructions of Cartesian authentication codes from symplectic geometry
Cited in
(7)- Construction of authentication codes with double arbiters over symplectic geometry
- A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields
- Construction of Cartesian authentication codes from unitary geometry
- Three constructions of perfect authentication codes from projective geometry over finite fields
- New methods of construction of Cartesian authentication codes from geometries over finite commutative rings
- scientific article; zbMATH DE number 1824724 (Why is no real title available?)
- scientific article; zbMATH DE number 2016674 (Why is no real title available?)
This page was built for publication: Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2439258)