On the public citation graph
Construction of Cartesian authentication codes from unitary geometry
0 signed · 30 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1974.tb02751.xopenalex-snapshot
Codes Which Detect Deception
inferredcites →https://doi.org/10.1007/3-540-39568-7_32openalex-snapshot
Authentication Theory/Coding Theory
inferredcites →https://doi.org/10.1007/bf00204449openalex-snapshot
A cartesian product construction for unconditionally secure authentication codes that permit arbitration
inferredcites →https://doi.org/10.1016/0012-365x(93)90013-jopenalex-snapshot
Anzahl theorems in finite singular symplectic, unitary and orthogonal geometries
inferredcites →https://doi.org/10.61091/jcmccopenalex-snapshot
Journal of Combinatorial Mathematics and Combinatorial Computing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.1456openalex-snapshot
Two new message authentication codes based on APN functions and stream ciphers
inferred← citeshttps://doi.org/10.1007/978-94-011-5454-3_12openalex-snapshot
Survey on Geometry of Classical Groups over Finite Fields and Its Applications
inferred← citeshttps://doi.org/10.1007/s10587-010-0030-6openalex-snapshot
Structure of unitary groups over finite group rings and its application
inferred← citeshttps://doi.org/10.1007/s11390-006-0740-2openalex-snapshot
Progress and Prospect of Some Fundamental Research on Information Security in China
inferred← citeshttps://doi.org/10.1007/s11766-999-0078-yopenalex-snapshot
Construction of authentication codes with arbitration from unitary geometry
inferred← citeshttps://doi.org/10.1007/s40314-022-01866-7openalex-snapshot
Construction of authentication codes based on orthogonal array and Latin square
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.06.013openalex-snapshot
Authentication codes and bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.ffa.2011.02.001openalex-snapshot
Singular linear space and its applications
inferred← citeshttps://doi.org/10.1016/j.laa.2010.11.007openalex-snapshot
A generalization of the formulas for intersection numbers of dual polar association schemes and their applications
inferred← citeshttps://doi.org/10.1016/j.laa.2012.07.030openalex-snapshot
Association schemes based on singular symplectic geometry over finite fields and its application
inferred← citeshttps://doi.org/10.1016/j.laa.2012.12.008openalex-snapshot
Anzahl formulas of subspaces in symplectic spaces and their applications
inferred← citeshttps://doi.org/10.1016/j.laa.2015.02.016openalex-snapshot
Several Anzahl theorems of alternate matrices over Galois rings
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00350-0openalex-snapshot
Geometry of classical groups over finite fields and its applications
inferred← citeshttps://doi.org/10.1016/s1005-8885(15)60639-2openalex-snapshot
Two constructions of A3-codes from projective geometry in finite fields
inferred← citeshttps://doi.org/10.1016/s1005-8885(17)60191-2openalex-snapshot
Construction of authentication codes with distrust arbitration from polynomials over finite fields
inferred← citeshttps://doi.org/10.1080/02522667.1995.10699211openalex-snapshot
Construction of Cartesian Authentication Codes from Pseudo Symplectic Geometry
inferred← citeshttps://doi.org/10.1109/icmlc.2008.4620584openalex-snapshot
Construction of authentication codes with arbitration from symplectic geometry
inferred← citeshttps://doi.org/10.1109/wicom.2010.5600974openalex-snapshot
A Construction of Cartesian Authentication Codes from Vector Space over Finite Field
inferred← citeshttps://doi.org/10.1142/s1005386713000679openalex-snapshot
Construction of Multi-receiver Multi-fold Authentication Codes from Singular Symplectic Geometry over Finite Fields
inferred← citeshttps://doi.org/10.1142/s1793830909000075openalex-snapshot
A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM ORTHOGONAL SPACES OVER A FINITE FIELD OF ODD CHARACTERISTIC
inferred← citeshttps://doi.org/10.1142/s179383091450027xopenalex-snapshot
A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM SINGULAR SYMPLECTIC SPACES OVER A FINITE FIELD
inferred← citeshttps://doi.org/10.1155/2011/675484openalex-snapshot
Some New Constructions of Authentication Codes with Arbitration and Multi‐Receiver from Singular Symplectic Geometry
inferred← citeshttps://doi.org/10.1155/2014/102301openalex-snapshot
A Construction of Multisender Authentication Codes with Sequential Model from Symplectic Geometry over Finite Fields
inferred← citeshttps://doi.org/10.1515/jmc-2017-0057openalex-snapshot
New methods of construction of cartesian authentication codes from geometries over finite commutative rings
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.