Asymptotic bounds on frameproof codes
We study the asymptotic behavior of frameproof codes. Some lower bounds are derived from the theory of error-correcting codes. In particular, the lower bound obtained directly by applying algebraic-geometry codes is improved by employing the Jacobian group structure of algebraic curves.
asymptotic behavior algebraic-geometry codes frame-proof codes