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.
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, 1976.
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.
N. Alon, J.H. Kim and J.H. Spencer, Nearly perfect matchings in regular simple hypergraphs, Preprint, 1996.
N. Alon and J.H. Spencer, The probabilistic method. John Wiley and Sons, New York, 1992.
P. Erdös and J. Spencer, Probabilistic methods in combinatorics, Akademic Press. New York, 1974.
P. Erdös and H. Hanani, On a limit theorem in combinatorial analysis. Publ. Math. Debrecen. 10 (1963) 10–13.
P. Frankl and V. Rödl, Near perfect coverings in graphs and hypergraphs, Europ. J. Combinatorics, 6 (1985), 317–326.
D.M. Gordon, O. Patashnik, G, Kuperberg and J.H. Spencer, Asymptotically optimal covering designs, J. Comb. Theory A 75 (1996) 270–280.
D.A. Grable, Nearly-perfect hypergraph packing is in NC, Information Process. Letters, 60 (1997) 295–299.
H. Iwaniec and J. Pintz, Primes in short intervals, Monatsch. Math. 98 (1984) 115–143.
J. Kahn, A linear programming perspective on the Frankl-Rödl-Pippenger theorem, Random Structures and Algorithms, 8 (1996) 149–157.
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.
N.N. Kuzjurin, On the difference between asymptotically good packings and coverings. — European J. Comb. 16 (1995) 35–40.
R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
M. Naor, L.J. Shulman and A. Srinivasan, Splitters and near-optimal derandomization, Proc. 36th Ann. IEEE FOCS, 1995, 182–191.
N. Pippenger and J. Spencer, Asymptotic behavior of the chromatic index for hypergraphs. J. Comb. Theory. Ser. A51 (1989) 24–42.
V. Rödl, On a packing and covering problem. Europ. J. Combinatorics. 5 (1985) 69–78.
V. Rödl and L. Thoma, Asymptotic packing and the random greedy algorithm, Random Structures Algorithms 8 (1996) 161–177.
M. Saks, A. Srinivasan and S. Zhou, Explicit dispersers with polylog degree, Proc. Annu. 27th ACM STOC-95, 1995, 479–488.
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.
I. Sparlinski, Finding irreducible and primitive polynomials, Appl. Algebra in Engin., Commun. and Computing, 4 (1993) 263–268.
J.H. Spencer, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1987.
J. Spencer, Asymptotic packing via a branching process, Random Structures Algorithms 7 (1995) 167–172.
J. Spencer, Asymptotically good coverings. Pacific J. Math. 118 (1985) 575–586.
V.A. Zinoviev, Cascade equal-weight codes and maximal packings, Problems of Control and Information Theory 12 (1983) 3–10.
Author information
Authors and Affiliations
Editor information
Rights 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