Construction of Cartesian authentication codes from unitary geometry
From MaRDI portal
Publication:1203950
DOI10.1007/BF00125202zbMath0764.94022OpenAlexW2091847967MaRDI QIDQ1203950
Publication date: 18 February 1993
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00125202
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Other types of codes (94B60)
Related Items
Construction of authentication codes based on orthogonal array and Latin square, Geometry of classical groups over finite fields and its applications, Association schemes based on singular symplectic geometry over finite fields and its application, Some new constructions of authentication codes with arbitration and multi-receiver from singular symplectic geometry, A generalization of the formulas for intersection numbers of dual polar association schemes and their applications, Anzahl formulas of subspaces in symplectic spaces and their applications, Singular linear space and its applications, Construction of authentication codes with arbitration from unitary geometry, Authentication codes and bipartite graphs, Structure of unitary groups over finite group rings and its application, A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM ORTHOGONAL SPACES OVER A FINITE FIELD OF ODD CHARACTERISTIC, A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields, Several Anzahl theorems of alternate matrices over Galois rings, Construction of Multi-receiver Multi-fold Authentication Codes from Singular Symplectic Geometry over Finite Fields
Cites Work
- Unnamed Item
- Unnamed Item
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
- On the unitary invariants of a surface of a vector space over a finite field
- Anzahl theorems in finite singular symplectic, unitary and orthogonal geometries
- Codes Which Detect Deception
