Skip to main content
SpringerLink
Log in

Locally explicit construction of rődl's asymptotically good packings

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1998 (MFCS 1998)

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

  • 164 Accesses

Abstract

We present a family of asymptotically good packings of l-subsets of an n-set by k-subsets and an algorithm that given a natural i finds the ith k-subset of this family. The bit complexity of this algorithm is almost linear in encoding length of i that is close to best possible complexity. A parallel NC-algorithm for this problem is presented as well.

This work was partially supported by the grant 98-01-00509 of the Russian Foundation for Fundamental Research. Part of this work was done while the author was visiting Bielefeld University.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, 1976.

    Google Scholar 

  2. N. Alon, J. Bruck, J. Naor, M. Naor and R. Roth, Construction of asymptotically good, low-rate error-correcting codes through pseudorandom graphs, IEEE Transactions on Information Theory, 38 (1992) 509–516.

    Article  MATH  Google Scholar 

  3. N. Alon, J.H. Kim and J.H. Spencer, Nearly perfect matchings in regular simple hypergraphs, Preprint, 1996.

    Google Scholar 

  4. N. Alon and J.H. Spencer, The probabilistic method. John Wiley and Sons, New York, 1992.

    MATH  Google Scholar 

  5. P. Erdös and J. Spencer, Probabilistic methods in combinatorics, Akademic Press. New York, 1974.

    MATH  Google Scholar 

  6. P. Erdös and H. Hanani, On a limit theorem in combinatorial analysis. Publ. Math. Debrecen. 10 (1963) 10–13.

    MathSciNet  Google Scholar 

  7. P. Frankl and V. Rödl, Near perfect coverings in graphs and hypergraphs, Europ. J. Combinatorics, 6 (1985), 317–326.

    MATH  Google Scholar 

  8. D.M. Gordon, O. Patashnik, G, Kuperberg and J.H. Spencer, Asymptotically optimal covering designs, J. Comb. Theory A 75 (1996) 270–280.

    Article  MATH  MathSciNet  Google Scholar 

  9. D.A. Grable, Nearly-perfect hypergraph packing is in NC, Information Process. Letters, 60 (1997) 295–299.

    Article  MathSciNet  Google Scholar 

  10. H. Iwaniec and J. Pintz, Primes in short intervals, Monatsch. Math. 98 (1984) 115–143.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. Kahn, A linear programming perspective on the Frankl-Rödl-Pippenger theorem, Random Structures and Algorithms, 8 (1996) 149–157.

    Article  MATH  MathSciNet  Google Scholar 

  12. R.M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, In Handbook of Theoretical Computer Science (ed. J. van Leeuwen), Elsevier, 1990, 869–942.

    Google Scholar 

  13. N.N. Kuzjurin, On the difference between asymptotically good packings and coverings. — European J. Comb. 16 (1995) 35–40.

    Article  MATH  MathSciNet  Google Scholar 

  14. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.

    Google Scholar 

  15. M. Naor, L.J. Shulman and A. Srinivasan, Splitters and near-optimal derandomization, Proc. 36th Ann. IEEE FOCS, 1995, 182–191.

    Google Scholar 

  16. N. Pippenger and J. Spencer, Asymptotic behavior of the chromatic index for hypergraphs. J. Comb. Theory. Ser. A51 (1989) 24–42.

    Article  MathSciNet  Google Scholar 

  17. V. Rödl, On a packing and covering problem. Europ. J. Combinatorics. 5 (1985) 69–78.

    Google Scholar 

  18. V. Rödl and L. Thoma, Asymptotic packing and the random greedy algorithm, Random Structures Algorithms 8 (1996) 161–177.

    Article  MATH  MathSciNet  Google Scholar 

  19. M. Saks, A. Srinivasan and S. Zhou, Explicit dispersers with polylog degree, Proc. Annu. 27th ACM STOC-95, 1995, 479–488.

    Google Scholar 

  20. I. Sparlinski, Approximate constructions in finite fields, In Finite Fields and Applications, London Math. Soc., Lect. Notes Ser., v. 233, Cambridge Univ. Press, Cambridge, 1996, 313–332.

    Google Scholar 

  21. I. Sparlinski, Finding irreducible and primitive polynomials, Appl. Algebra in Engin., Commun. and Computing, 4 (1993) 263–268.

    Article  Google Scholar 

  22. J.H. Spencer, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1987.

    MATH  Google Scholar 

  23. J. Spencer, Asymptotic packing via a branching process, Random Structures Algorithms 7 (1995) 167–172.

    MATH  MathSciNet  Google Scholar 

  24. J. Spencer, Asymptotically good coverings. Pacific J. Math. 118 (1985) 575–586.

    MATH  MathSciNet  Google Scholar 

  25. V.A. Zinoviev, Cascade equal-weight codes and maximal packings, Problems of Control and Information Theory 12 (1983) 3–10.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for System Programming, Russian Academy of Sciences, B. Kommunisticheskaya 25, 109004, Moscow

    Nikolai N. Kuzjurin

Authors
  1. Nikolai N. Kuzjurin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luboš Brim Jozef Gruska Jiří Zlatuška

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuzjurin, N.N. (1998). Locally explicit construction of rődl's asymptotically good packings. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055768

Download citation

  • DOI: https://doi.org/10.1007/BFb0055768

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68532-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation