Skip to main content
SpringerLink
Log in

Algorithmic Aspects on the Construction of Separating Codes

  • Conference paper
  • First Online:
Analysis of Experimental Algorithms (SEA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11544))

Included in the following conference series:

  • 650 Accesses

Abstract

In this paper, we discuss algorithmic aspects of separating codes, that is, codes where any two subsets (of a specified size) of their code words have at least one position with distinct elements. More precisely we focus on the (non trivial) case of binary 2-separating codes. Firstly, we use the Lovász Local Lemma to obtain a lower bound on the existence of such codes that matches the previously best known lower bound. Then, we use the algorithmic version of the Lovász Local Lemma to construct such codes and discuss its implications regarding computational complexity. Finally, we obtain explicit separating codes, with computational complexity polynomial in the length of the code and with rate larger than the well-known Simplex code.

The work of Marcel Fernandez has been supported by TEC2015-68734-R (MINECO/FEDER) “ANFORA” and 2017 SGR 782.

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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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

References

  1. Achlioptas, D., Iliopoulos, F.: Random walks that find perfect objects and the Lovász local lemma. J. ACM (JACM) 63(3), 22 (2016)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Deng, D., Stinson, D.R., Wei, R.: The Lovász local lemma and its applications to some combinatorial arrays. Des. Codes Crypt. 32(1–3), 121–134 (2004)

    Article  Google Scholar 

  4. Erdős, P., Lovász, L.: Problems and results on 3-chromatic hypergraphs and some related questions. Infin. Finite Sets 10, 609–627 (1975)

    MathSciNet  MATH  Google Scholar 

  5. Gebauer, H., Moser, R.A., Scheder, D., Welzl, E.: The Lovász local lemma and satisfiability. In: Albers, S., Alt, H., Näher, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 30–54. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03456-5_3

    Chapter  MATH  Google Scholar 

  6. Gebauer, H., Szabó, T., Tardos, G.: The local lemma is tight for SAT. In: Proceedings 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 664–674. SIAM (2011)

    Google Scholar 

  7. Giotis, I., Kirousis, L., Psaromiligkos, K.I., Thilikos, D.M.: On the algorithmic Lovász local lemma and acyclic edge coloring. In: Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics. Society for Industrial and Applied Mathematics (2015). http://epubs.siam.org/doi/pdf/10.1137/1.9781611973761.2

  8. Giotis, I., Kirousis, L., Psaromiligkos, K.I., Thilikos, D.M.: Acyclic edge coloring through the Lovász local lemma. Theoret. Comput. Sci. 665, 40–50 (2017)

    Article  MathSciNet  Google Scholar 

  9. Giotis, I., Kirousis, L., Livieratos, J., Psaromiligkos, K.I., Thilikos, D.M.: Alternative proofs of the asymmetric Lovász local lemma and Shearer’s lemma. In: Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, GASCom (2018). http://ceur-ws.org/Vol-2113/paper15.pdf

  10. Harvey, N.J., Vondrák, J.: An algorithmic proof of the Lovász local lemma via resampling oracles. In: Proceedings 56th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1327–1346. IEEE (2015)

    Google Scholar 

  11. Kirousis, L., Livieratos, J.: A simple algorithmic proof of the symmetric lopsided Lovász local lemma. In: Battiti, R., Brunato, M., Kotsireas, I., Pardalos, P.M. (eds.) LION 12 2018. LNCS, vol. 11353, pp. 49–63. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-05348-2_5

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  13. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, vol. 16. Elsevier, Amsterdam (1977)

    MATH  Google Scholar 

  14. Moser, R.A.: A constructive proof of the Lovász local lemma. In: Proceedings 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 343–350. ACM (2009)

    Google Scholar 

  15. Moser, R.A., Tardos, G.: A constructive proof of the general Lovász local lemma. J. ACM (JACM) 57(2), 11 (2010)

    Article  Google Scholar 

  16. Sagalovich, Y.L.: Separating systems. Problems Inform. Transmission 30(2), 105–123 (1994)

    MathSciNet  MATH  Google Scholar 

  17. Sarkar, K., Colbourn, C.J.: Upper bounds on the size of covering arrays. SIAM J. Discrete Math. 31(2), 1277–1293 (2017)

    Article  MathSciNet  Google Scholar 

  18. Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms. Addison-Wesley, Boston (2013)

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  20. Szegedy, M.: The Lovász local lemma – a survey. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 1–11. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38536-0_1

    Chapter  Google Scholar 

  21. Tao, T.: Moser’s entropy compression argument (2009). https://terrytao.wordpress.com/2009/08/05/mosers-entropy-compression-argument/

Download references

Author information

Authors and Affiliations

  1. Department of Network Engineering, Universitat Politecnica de Catalunya, Barcelona, Spain

    Marcel Fernandez

  2. Department of Mathematics, National and Kapodistrian University of Athens, Athens, Greece

    John Livieratos

Authors
  1. Marcel Fernandez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Livieratos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to John Livieratos .

Editor information

Editors and Affiliations

  1. Wilfrid Laurier University, Waterloo, ON, Canada

    Ilias Kotsireas

  2. University of Florida, Gainesville, FL, USA

    Panos Pardalos

  3. University of Ioannina, Ioannina, Greece

    Konstantinos E. Parsopoulos

  4. Delft University of Technology, Delft, The Netherlands

    Dimitris Souravlias

  5. University of Florida, Gainesville, FL, USA

    Arsenis Tsokas

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fernandez, M., Livieratos, J. (2019). Algorithmic Aspects on the Construction of Separating Codes. In: Kotsireas, I., Pardalos, P., Parsopoulos, K., Souravlias, D., Tsokas, A. (eds) Analysis of Experimental Algorithms. SEA 2019. Lecture Notes in Computer Science(), vol 11544. Springer, Cham. https://doi.org/10.1007/978-3-030-34029-2_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-34029-2_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-34028-5

  • Online ISBN: 978-3-030-34029-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation