Skip to main content
SpringerLink
Log in

Separating and Intersecting Properties of BCH and Kasami Codes

  • Conference paper
Cryptography and Coding (Cryptography and Coding 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2898))

Included in the following conference series:

Abstract

Separating codes have recently been applied in the construction of collusion secure fingerprinting schemes. They are related to other combinatorial concepts like intersecting codes, superimposed codes, hashing families, and group testing. In this paper we study some good, binary asymptotic constructions of such codes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N.: Explicit construction of exponential sized families of k-independent sets. Discrete Math. 58(2), 191–193 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  2. Barg, A., Blakley, G.R., Kabatiansky, G.A.: Digital fingerprinting codes: Problem statements, constructions, identification of traitors. IEEE Trans. Inform. Theory 49(4), 852–865 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Barg, A., Cohen, G., Encheva, S., Kabatiansky, G., Zémor, G.: A hypergraph approach to the identifying parent property. SIAM J. Disc. Math. 14(3), 423–431 (2001)

    Article  MATH  Google Scholar 

  4. Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inform. Theory 44(5), 1897–1905 (1998); Presented in part 1995, see Springer LNCS

    Article  MATH  MathSciNet  Google Scholar 

  5. Bose, B., Rao, T.R.N.: Separating and completely separating systems and linear codes. IEEE Trans. Comput. 29(7), 665–668 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 257–270. Springer, Heidelberg (1994)

    Google Scholar 

  7. Chor, B., Fiat, A., Naor, M., Pinkas, B.: Tracing traitors. IEEE Trans. Inform. Theory 46(3), 893–910 (2000)

    Article  MATH  Google Scholar 

  8. Cohen, G.D., Zémor, G.: Intersecting codes and independent families. IEEE Trans. Inform. Theory 40, 1872–1881 (1994)

    Article  MATH  Google Scholar 

  9. Cohen, G.D., Encheva, S.B.: Efficient constructions of frameproof codes. Electronics Letters 36(22) (2000)

    Google Scholar 

  10. Cohen, G.D., Encheva, S.B., Litsyn, S., Schaathun, H.G.: Erratum to ’intersecting codes and separating codes’. Discrete Applied Mathematics (2003) (Submitted)

    Google Scholar 

  11. Cohen, G.D., Encheva, S.B., Litsyn, S., Schaathun, H.G.: Intersecting codes and separating codes. Discrete Applied Mathematics 128(1), 75–83 (2003)

    Article  MathSciNet  Google Scholar 

  12. Cohen, G.D., Encheva, S.B., Schaathun, H.G.: On separating codes. Technical report, Ecole Nationale Sup rieure des T l communications (2001)

    Google Scholar 

  13. Cohen, G.D., Schaathun, H.G.: Asymptotic overview on separating codes (May 2003) Available at, http://www.ii.uib.no/publikasjoner/texrap/index.shtml

  14. Delsarte, P., Goethals, J.-M.: Tri-weight codes and generalized Hadamard matrices. Information and Control 15, 196–206 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  15. Friedman, A.D., Graham, R.L., Ullman, J.D.: Universal single transition time asynchronous state assignments. IEEE Trans. Comput. 18, 541–547 (1969)

    Article  Google Scholar 

  16. Helleseth, T., Kumar, P.V.: The weight hierarchy of the Kasami codes. Discrete Math. 145(1-3), 133–143 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  17. Kasami, T.: Weight distributions of Bose-Chaudhuri-Hocquenghem codes. In: Combinatorial Mathematics and its Applications (Proc. Conf., Univ. North Carolina, Chapel Hill, N.C., 1967), pp. 335–357. Univ. North Carolina Press, Chapel Hill (1969)

    Google Scholar 

  18. Körner, J., Simonyi, G.: Separating partition systems and locally different sequences. SIAM J. Discrete Math. 1, 355–359 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  19. Körner, J.: On the extremal combinatorics of the Hamming space. J. Combin. Theory Ser. A 71(1), 112–126 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  20. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)

    MATH  Google Scholar 

  21. Sagalovich, Y.L.: Separating systems. Problems of Information Transmission 30(2), 105–123 (1994)

    MATH  MathSciNet  Google Scholar 

  22. Schaathun, H.G.: Fighting two pirates. In: Fossorier, M.P.C., Høholdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol. 2643, pp. 71–78. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  23. Staddon, J.N., Stinson, D.R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inform. Theory 47(3), 1042–1049 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  24. Stinson, D.R., Wei, R.: Combinatorial properties and constructions of trace-ability schemes and frameproof codes. SIAM J. Discrete Math. 11(1), 41–53 (1998) (electronic)

    Article  MATH  MathSciNet  Google Scholar 

  25. Stinson, D.R., Van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Stat. Planning and Inference 86(2), 595–617 (2000)

    Article  MATH  Google Scholar 

  26. Tsfasman, M.A.: 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)

    Article  MATH  MathSciNet  Google Scholar 

  27. Unger, S.H.: Asynchronous Sequential Switching Circuits. Wiley, Chichester (1969)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Informatics, University of Bergen, Pb. 7800, N-5020, Bergen, Norway

    Hans Georg Schaathun & Tor Helleseth

Authors
  1. Hans Georg Schaathun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tor Helleseth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Security Group, Royal Holloway, University of London, TW20 0EX, Egham, Surrey, U.K.

    Kenneth G. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schaathun, H.G., Helleseth, T. (2003). Separating and Intersecting Properties of BCH and Kasami Codes. In: Paterson, K.G. (eds) Cryptography and Coding. Cryptography and Coding 2003. Lecture Notes in Computer Science, vol 2898. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40974-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-40974-8_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20663-7

  • Online ISBN: 978-3-540-40974-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation