On the public citation graph
Asymptotic bounds on frameproof codes
0 signed · 45 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/mana.19821090103openalex-snapshot
Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound
inferredcites →https://doi.org/10.1006/ffta.1996.0016openalex-snapshot
Low-Discrepancy Sequences and Global Function Fields with Many Rational Places
inferredcites →https://doi.org/10.1017/cbo9781107325951openalex-snapshot
Rational Points on Curves over Finite Fields
inferredcites →https://doi.org/10.1049/el:20001324openalex-snapshot
Efficient constructions of frameproof codes
inferredcites →https://doi.org/10.1109/18.705568openalex-snapshot
Collusion-secure fingerprinting for digital data
inferredcites →https://doi.org/10.1109/18.904533openalex-snapshot
Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds
inferredcites →https://doi.org/10.1109/18.915661openalex-snapshot
Combinatorial properties of frameproof and traceability codes
inferredcites →https://doi.org/10.1109/18.959283openalex-snapshot
New results on frame-proof codes and traceability schemes
inferredcites →https://doi.org/10.1137/s0895480196304246openalex-snapshot
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-5334-4openalex-snapshot
Topics in Geometry, Coding Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/1-4020-5334-4_2openalex-snapshot
FUNCTION FIELDS OVER FINITE FIELDS AND THEIR APPLICATIONS TO CRYPTOGRAPHY
inferred← citeshttps://doi.org/10.1007/11586821_5openalex-snapshot
A Trellis-Based Bound on (2,1)-Separating Codes
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_36openalex-snapshot
Separating Codes: Constructions and Bounds
inferred← citeshttps://doi.org/10.1007/s10623-006-9030-9openalex-snapshot
Sliding-window dynamic frameproof codes
inferred← citeshttps://doi.org/10.1007/s10623-018-0490-5openalex-snapshot
Improved bounds on 2-frameproof codes with length 4
inferred← citeshttps://doi.org/10.1007/s10623-020-00797-wopenalex-snapshot
Wide-sense 2-frameproof codes
inferred← citeshttps://doi.org/10.1007/s10623-025-01631-xopenalex-snapshot
New upper bounds for wide-sense frameproof codes
inferred← citeshttps://doi.org/10.1007/s11856-012-0126-9openalex-snapshot
(2, 1)-Separating systems beyond the probabilistic bound
inferred← citeshttps://doi.org/10.1007/s12095-026-00874-2openalex-snapshot
Constructions of $$\bar{3}$$-separable codes with length 4
inferred← citeshttps://doi.org/10.1016/j.jco.2012.02.005openalex-snapshot
Bilinear complexity of algebras and the Chudnovsky–Chudnovsky interpolation method
inferred← citeshttps://doi.org/10.1016/j.jcta.2007.04.005openalex-snapshot
On generalized separating hash families
inferred← citeshttps://doi.org/10.1016/j.jnt.2005.04.009openalex-snapshot
On the existence of non-special divisors of degree g and g-1 in algebraic function fields over Fq
inferred← citeshttps://doi.org/10.1070/rm9928openalex-snapshot
On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
inferred← citeshttps://doi.org/10.1109/cig.2010.5592905openalex-snapshot
Hecke operators with odd determinant and binary frameproof codes beyond the probabilistic bound?
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619230openalex-snapshot
Near Optimal Constructions of Frameproof Codes
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653680openalex-snapshot
Error-Tolerant Frameproof Codes
inferred← citeshttps://doi.org/10.1109/itwksps.2010.5503130openalex-snapshot
On iterated logarithm solutions to identification protocols
inferred← citeshttps://doi.org/10.1109/tit.2007.894632openalex-snapshot
Achievable Error Exponents for the Private Fingerprinting Game
inferred← citeshttps://doi.org/10.1109/tit.2012.2197812openalex-snapshot
Improved Constructions of Frameproof Codes
inferred← citeshttps://doi.org/10.1109/tit.2013.2237944openalex-snapshot
Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans
inferred← citeshttps://doi.org/10.1109/tit.2014.2314099openalex-snapshot
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications
inferred← citeshttps://doi.org/10.1109/tit.2016.2642987openalex-snapshot
New Lower Bounds for Secure Codes and Related Hash Families: A Hypergraph Theoretical Approach
inferred← citeshttps://doi.org/10.1109/tit.2025.3558360openalex-snapshot
Near Optimal Probabilistic Constructions of Frameproof Codes
inferred← citeshttps://doi.org/10.1504/ijicot.2017.083843openalex-snapshot
On metric convexity, the discrete Hahn-Banach theorem, separating systems and sets of points forming only acute angles
inferred← citeshttps://doi.org/10.4213/rm9928openalex-snapshot
О тензорном ранге умножения в конечных расширениях конечных полей и о связанных с этим вопросах алгебраической геометрии
inferred← citeshttps://doi.org/10.48550/arxiv.1103.4335openalex-snapshot
Diviseurs de la forme 2D-G sans sections et rang de la multiplication dans les corps finis (Divisors of the form 2D-G without sections and bilinear complexity of multiplication in finite fields)
inferred← citeshttps://doi.org/10.48550/arxiv.2009.01281openalex-snapshot
Algebraic geometry codes and some applications
inferred← citeshttps://doi.org/10.48550/arxiv.2108.07987openalex-snapshot
Improved Lower Bounds for Secure Codes and Related Structures
inferred← citeshttps://doi.org/10.48550/arxiv.math/0410193openalex-snapshot
On the existence of non-special divisors of degree $g$ and $g-1$ in algebraic function fields over $\F_q$
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.