Fighting two pirates

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2643, Issue , 2003, Pages 71-78

  Schaathun, Hans Georg ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CRIME;

FINGERPRINTING SCHEMES;

CODES (SYMBOLS);

EID: 21144436639     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44828-4_9     Document Type: Article

References (11)

1. A. Barg, G.R. Blakley, and G. Kabatiansky. Good digital fingerprinting Codes. Technical report, DIMACS, 2001.
2. Dan Boneh and James Shaw. Collusion-secure fingerprinting for digital data. IEEE Trans. Inform. Theory, 44(5):1897-1905, 1998.
3. Presented in part 1995, see Springer LNCS.
4. Bella Bose and T.R.N. Rao. Separating and completely separating systems and linear Codes. IEEE Trans. Comput., 29(7):665-668, 1980.
5. Gérard Cohen and Gilles Zemor. Intersecting Codes and independent families. IEEE Trans. Inform. Theory, 40:1872-1881, 1994.
6. Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, and Hans Georg Schaathun. Intersecting Codes and separating Codes. Discrete Applied Mathematics, 2001. To appear.
7. A.D. Friedman, R.L. Graham, and J.D. Ullman. Universal single transition time asynchronous state assignments. IEEE Trans. Comput., 18:541-547, 1969.
8. Jacob Löfvenberg. Codes for Digital Fingerprinting. PhD thesis, Linköpings Universitet, 2001. http://www.it.isy.liu.se/publikationer/index.html.
9. Yu.L. Sagalovich. A method for increasing the reliability of finite automata. Problems of Information Transmission, 1(2):27-35, 1965.
10. Yu.L. Sagalovich. Separating systems. Problems of Information Transmission, 30(2):105-123, 1994.
11. Michael A. Tsfasman. Algebraic-geometric Codes and asymptotic Problems. Discrete Appl. Math., 33(1-3):241-256, 1991. Applied algebra, algebraic algorithms, and error-correcting codes (Toulouse, 1989).