Title :
Asymptotic bounds on frameproof codes
Author_Institution :
Dept. of Math., Nat. Univ. of Singapore, Singapore
fDate :
11/1/2002 12:00:00 AM
Abstract :
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
Keywords :
algebraic codes; error correction codes; geometric codes; group codes; Jacobian group structure; algebraic curves. digital fingerprinting; algebraic-geometry codes; asymptotic bounds; error-correcting codes; frameproof codes; lower bounds; traceability; Chaos; Cryptography; Error correction codes; Fingerprint recognition; Galois fields; Information theory; Jacobian matrices; Mathematics; Polynomials;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2002.804111
