Skip to main content

Copyright Control and Separating Systems

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2003)

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

Abstract

Separating systems have earlier been shown to be useful in designing asynchronous sequential circuits, finite automata and fingerprinting. In this paper we study the problem of constructing (s,1)-separating systems from codes and designs.

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

Access this chapter

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. A. Barg, G. Cohen, S. Encheva, G. Kabatiansky and G. Zémor, “A hypergraph approach to the identifying parent property”, SIAM J. Disc. Math., vol. 14, No. 3, pp. 423–431 (2001).

    Article  MATH  Google Scholar 

  2. D. Boneh and J. Shaw, “Collusion-secure fingerprinting for digital data”, Springer-Verlag LNCS 963 pp. 452–465 (1995).

    Google Scholar 

  3. G. Cohen and G. Zémor, “Intersecting codes and independent families”, IEEE Trans. Inform. Theory, 40, pp. 1872–1881, (1994).

    Article  MATH  Google Scholar 

  4. G. Cohen and S. Encheva, “Efficient constructions of frameproof codes”, Electronics Letters 36(22) pp. 1840–1842 (2000).

    Article  Google Scholar 

  5. G. Cohen, S. Encheva and H.G. Schaathun, “More on (2,2)-separating systems”, IEEE Trans. Inform. Theory, 48, pp. 2606–2609, (2002).

    Article  MATH  MathSciNet  Google Scholar 

  6. C. Lam and V.D. Tonchev, “Classification of affine resolvable 2-(27,9,4) designs”, J. Statist. Plann. Inference 56(2), pp. 187–202 (1996).

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  8. V.S. Pless, W.C. Huffman, Editors, Handbook of Coding Theory, Elsevier, Amsterdam (1998).

    MATH  Google Scholar 

  9. Yu.L. Sagalovitch, “Separating systems”, Problems of Information Transmission 30(2) pp. 105–123 (1994).

    MathSciNet  Google Scholar 

  10. D.R. Stinson, Tran Van Trung and R. Wei, “Secure Frameproof Codes, Key Distribution Patterns, Group Testing Algorithms and Related Structures”, J. Stat. Planning and Inference 86(2) pp. 595–617 (2000).

    Article  MATH  Google Scholar 

  11. D.R. Stinson and R. Wei, “Combinatorial properties and constructions of traceability schemes and frameproof codes”, SIAM J. Discrete Math 11 pp. 41–53 (1998).

    Article  MATH  MathSciNet  Google Scholar 

  12. V. Tonchev, “Quasi-symmetric 2-(31,7,7) designs and a revision of Hamada’s conjecture”, J. Comb. Theory Ser. A 42 pp. 104–110 (1986).

    Article  MATH  MathSciNet  Google Scholar 

  13. M.A. Tsfasmann, “Algebraic-geometric codes and asymptotic problems”, Discrete Appl. Math. 33 241–256 (1991).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Encheva, S., Cohen, G. (2003). Copyright Control and Separating Systems. In: Fossorier, M., Høholdt, T., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2003. Lecture Notes in Computer Science, vol 2643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44828-4_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-44828-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44828-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics