A construction of multi-sender authentication codes from pseudo-symplectic geometry over finite fields
From MaRDI portal
Recommendations
- A new construction of multisender authentication codes from pseudosymplectic geometry over finite fields
- A new construction of multi-receiver authentication codes from pseudo-symplectic geometry over finite fields.
- scientific article; zbMATH DE number 6843227
- A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields
- One construction of multireceiver authentication codes from pseudo-symplectic geometry over finite fields.
Cited in
(10)- A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields
- A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields
- A new construction of multisender authentication codes from polynomials over finite fields
- A new construction of multi-sender authentication codes from polynomials over finite fields.
- One construction of multireceiver authentication codes from pseudo-symplectic geometry over finite fields.
- A new construction of multisender authentication codes from symplectic geometry over finite fields.
- A new construction of multisender authentication codes from pseudosymplectic geometry over finite fields
- scientific article; zbMATH DE number 6843227 (Why is no real title available?)
- A new construction of multi-receiver authentication codes from pseudo-symplectic geometry over finite fields.
- A construction of multi-sender authentication codes from eigenvalues and eigenvectors of the matrix over finite fields
This page was built for publication: A construction of multi-sender authentication codes from pseudo-symplectic geometry over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936661)
