Three constructions of perfect authentication codes from projective geometry over finite fields

DOI10.1016/J.AMC.2014.12.088MaRDI QIDQ298846zbMATH OpenOpenAlexFDO

Authors Shangdi Chen, Xiaolian Zhang

Publication date 21 June 2016

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2014.12.088

zbMATH Keywords

projective geometryauthentication codearbitrationperfectsplitting

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• scientific article; zbMATH DE number 1247722
• On the construction of authentication codes that permit arbitration over projective spaces
• Three constructions of authentication codes from power function over finite fields with perfect secrecy.
• Three constructions of authentication codes with perfect secrecy
• New Family of Non-Cartesian Perfect Authentication Codes

Cites work

• scientific article; zbMATH DE number 6001808 (Why is no real title available?)
• scientific article; zbMATH DE number 3856985 (Why is no real title available?)
• scientific article; zbMATH DE number 1303980 (Why is no real title available?)
• scientific article; zbMATH DE number 1789703 (Why is no real title available?)
• A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
• A new class of 3-fold perfect splitting authentication codes
• An Anzahl formula for the number of subspaces in finite vector spaces and its application
• Codes Which Detect Deception
• Combinatorial bounds on authentication codes with arbitration.
• Construction of authentication codes with arbitration from singular symplectic geometry over finite fields
• Further results on asymmetric authentication schemes
• Lower bounds on the probability of deception in authentication with arbitration
• Message authentication with arbitration of transmitter/receiver disputes
• New bounds and constructions for authentication/secrecy codes with splitting
• New combinatorial designs and their applications to authentication codes and secret sharing schemes.
• Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields

Cited in

(2)

• New Family of Non-Cartesian Perfect Authentication Codes
• Construction of perfect authentication codes with distrust arbitration based on matrices over finite fields.

This page was built for publication: Three constructions of perfect authentication codes from projective geometry over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q298846)