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

DOI10.1016/j.amc.2014.12.088zbMath1338.94108OpenAlexW2072104929MaRDI QIDQ298846

Xiaolian Zhang, Shang-di Chen

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

splittingprojective geometryarbitrationauthentication codeperfect

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new class of 3-fold perfect splitting authentication codes
• A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
• New bounds and constructions for authentication/secrecy codes with splitting
• New combinatorial designs and their applications to authentication codes and secret sharing schemes.
• Further results on asymmetric authentication schemes
• Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields
• Lower bounds on the probability of deception in authentication with arbitration
• Codes Which Detect Deception
• Message Authentication with Arbitration of Transmitter/Receiver Disputes
• Combinatorial bounds on authentication codes with arbitration.

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