Asymptotic bounds on frameproof codes

IEEE Transactions on Information Theory

Volumn 48, Issue 11, 2002, Pages 2991-2995

  Xing, Chaoping ^a,b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Algebraic geometry codes; Asymptotic behavior; Frameproof codes

Indexed keywords

ASYMPTOTIC STABILITY; COMBINATORIAL MATHEMATICS; ERROR CORRECTION; GEOMETRY; LINEAR ALGEBRA; SET THEORY; THEOREM PROVING;

ERROR CORRECTING CODES; FRAMEPROOF CODES; JACOBIAN GROUP STRUCTURE;

CODES (SYMBOLS);

EID: 0036847453     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.804111     Document Type: Letter

References (15)

1. S. R. Blackburn, "Frameproof codes," preprint, 2001.
2. D. Boneh and J. Shaw, "Collision-secure fingerprinting for digital data," IEEE Tran. Inform. Theory, vol. 44, pp. 1897-1905, Sept. 1998.
3. B. Chor, A. Fiat, and M. Naor, "Tracing traitors," in Advances in Cryptology-CRYPTO'94 (Lecture Notes in Computer Science), Y. G. Desmedt, Ed. Berlin, Germany: Springer-Verlag, 1994, vol. 839, pp. 527-270.
4. G. Cohen and S. Encheva, "Efficient constructions of frameproof codes," Electron. Lett., vol. 36, pp. 1840-1842, 2000.
5. A. Fiat and T. Tassa, "Dynamic traitor tracing," in Advances in Cryptology-CRYPTO'99 (Lecture Notes in Computer Science), M. Weiner, Ed. Berlin: Springer-Verlag, 1999, vol. 1666, pp. 354-371.
6. Y. Ihara, "Some remarks on the number of rational points of algebraic curves over finite fields," J. Fac. Sci. Univ. Tokyo Sect. IA Math., vol. 28, pp. 721-724, 1981.
7. D. Mumford, Abelian Varieties. Oxford, U.K.: Oxford Univ. Press, 1970.
8. H. Niederreiter and C. P. Xing, "Low-discrepancy sequences and global function fields with many rational places," Finite Fields Appl., vol. 2, pp. 241-273, 1996.
9. ____, Rational Points on Curves Over Finite Fields: Theory and Applications. Cambride, U.K.: Cambridge Univ. Press, 2001, LMS 285.
10. ____, "A construction of digital nets with good asymptotic behavior," Acta Arith., to be published.
11. R. Safavi-Naini and Y. Wang, "New results on frame proof codes and traceability schemes," IEEE Trans. Inform. Theory, vol. 47, pp. 3029-3033, Nov. 2001.
12. J. N. Staddon, D. R. Stinson, and R. Wei, "Combinatorial properties of frameproof and traceability codes," IEEE Trans. Inform. Theory, vol. 47, pp. 1042-1049, Mar. 2001.
13. D. R. Stinson and R. Wei, "Combinatorial properties and constructions of traceability schemes and frameproof codes," SIAM J. Discr. Math., vol. 11, pp. 41-53, 1998.
14. M. A. Tsfasman, S. G. Vlǎduţ, and T. Zink, "Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound," Math. Nachrichtentech., vol. 109, pp. 21-28, 1982.
15. C. P. Xing, "Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vlǎdut-Zink bounds," IEEE Trans. Inform. Theory, vol. 47, pp. 347-352, Jan. 2001.