Asymptotic bounds on frameproof codes
Chaoping Xing · IEEE Transactions on Information Theory · 2002
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.