Hecke operators with odd determinant and binary frameproof codes beyond the probabilistic bound?

2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

Volumn , Issue , 2010, Pages

  Randriam, Hugues ^a  

^a INSTITUT TELECOM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC CURVES; ASYMPTOTIC RATE; FRAMEPROOF CODES; HECKE OPERATORS; LOWER BOUNDS; PROBABILISTIC BOUNDS;

INFORMATION THEORY;

EID: 80051944719     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2010.5592905     Document Type: Conference Paper

References (19)

1. D. Boneh and J. Shaw, "Collusion-secure fingerprinting for digital data," IEEE Trans. Inform. Theory 44 (1998) 1897-1905. (Pubitemid 128738559)
2. G. Cohen, "Separation and witnesses", in: C. Xing et al. (Eds), IWCC 2009, LNCS 5557, 12-21, Springer, 2009.
3. G. Cohen and A. Lempel, "Linear intersecting codes," Discr. Math. 56 (1985) 35-43.
4. H. Cohen and H.W. Lenstra, Jr., "Heuristics on class groups of number fields", in: Number theory, Noordwijkerhout 1983, LNM 1068, Springer.
5. G.D. Forney, Concatenated codes, MIT Press, 1966.
6. A. D. Friedman, R. L. Graham, and J. D. Ullman, "Universal single transition time asynchronous state assignments," IEEE Trans. Comput. 18 (1969) 541-547.
7. E. Friedman and L.C. Washington, "On the distribution of divisor class groups of curves over a finite field", in: Théorie des nombres (Quebec, 1987), de Gruyter, 227-239.
8. A. Garcia and H. Stichtenoth, "A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound," Invent. Math. 121 (1995) 211-222.
9. Y. Ihara, "Some remarks on the number of rational points of algebraic curves over finite fields," J. Fac. Sci. Univ. Tokyo Sect. IA Math. 28 (1981) 721-724.
10. J. Körner, "On the extremal combinatorics of the Hamming space," J. Combin. Theory Ser. A 71 (1995) 112-126.
11. A. Krasnopeev and Yu. L. Sagalovich, "The Kerdock codes and separating systems", in: ACCT-8, Tsarskoe Selo (St Petersbourg) 2002, 165-167.
12. D. Miklós, "Linear binary codes with intersection properties," Discr. Appl. Math. 9 (1984) 187-196. (Pubitemid 14667240)
13. D. Mumford, Abelian varieties, Oxford Univ. Press, 1974.
14. H. Niederreiter, H. Wang, and C. Xing, "Function fields over finite fields and their applications to cryptography", in: A. Garcia and H. Stichtenoth, Topics in geometry, coding theory and cryptography, Springer, 2007.
15. Yu. L. Sagalovich and A. G. Chilingarjan, "Separating systems and new scopes of its application," Information Processes 9 (2009) 225-248.
16. p," J. Amer. Math. Soc. 10 (1997) 75-102.
17. D. R. Stinson and R. Wei, "Combinatorial properties and constructions of traceability schemes and frameproof codes," SIAM J. Discr. Math. 11 (1998) 41-53. (Pubitemid 128618904)
18. M. A. Tsfasman, S. G. Vladut, and T.Zink, "Modular curves, Shimura curves, and Goppa codes better than Varshamov-Gilbert bound," Math. Nachr. 109 (1982) 21-28.
19. C. Xing, "Asymptotic bounds on frameproof codes," IEEE Trans. Inform. Theory 48 (2002) 2991-2995. (Pubitemid 35327611)