Intersecting Codes and Independent Families

IEEE Transactions on Information Theory

Volumn 40, Issue 6, 1994, Pages 1872-1881

  Cohen, Gérard D ^a   Zémor, Gilles ^a  

^a TELECOM PARISTECH   (France)

Author keywords

derandomization; Intersecting code; t independence

Indexed keywords

ERROR CORRECTION; INTEGRATED CIRCUIT TESTING; PROBABILITY; VECTORS; VLSI CIRCUITS;

CONCATENATION METHODS; DERANDOMIZATION; INDEPENDENT FAMILIES; INTERSECTING CODES;

BINARY CODES;

EID: 0028550581     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.340462     Document Type: Article

References (36)

1. N. Alon, “Explicit construction of exponential sized families of k-independent sets,” Discrete Math., vol. 58, pp. 191-193, 1986.
2. N. Alon, L. Babai, and A. Itai, “A fast and simple randomized algorithm for the maximal independent set problem,” J. Algorithms, vol. 7, pp. 567-583, 1986.
3. N. Alon, J. Bruck, J. Naor, M. Naor, and R. Roth, “Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs,” IEEE Trans. Inform. Theory, vol. 38, pp. 509-516, 1992.
4. B. Becker and H.-U. Simon, “How robust is the n-cube?" Inform. Computat., vol. 77, pp. 162-178, 1988.
5. C. Berge, Hypergraphes. Gauthier-Villars, Paris, 1987.
6. G. B. Rassard, C. Crepeau, and J.-M. Robert, “Information-theoretic reductions among disclosure problems,” in Proc. 27th IEEE Symp. Foundat. Comput. Sci., 1986, pp. 168-173.
7. P. Busschbach, “Constructive methods to solve the problems of: s-surjectivity, conflict resolution, coding in defective memories,” Ecole Nationale Superieure des Telecom., Tech. Rep. 84D005, Dec. 1984.
8. G. Cohen and A. Lempel, “Linear intersecting codes,” Discrete Math., vol. 56, 35-43, 1985.
9. C. Crepeau and M. Santha, “Efficient reduction among oblivious transfer protocols,” in Sequences II, R. Capocelli et al., Eds. New York: Springer-Verlag, 1993, 360-367.
10. I. I. Dumer, “Asymptotically optimal codes correcting memory defects of fixed multiplicity,” Problemy Peredachi Informatsii, vol. 25, 3-20, 1989.
11. G. Freiman, E. Lipkin, and L. Levitin, “A polynomial algorithm for constructing families of k-independent sets,” Discrete Math., vol. 70, pp. 137-147, 1988.
12. L. Gargano, J. Korner, and U. Vaccaro, “Capacities: From information theory to extremal set theory,” J Comb. Theory A, vol. 68, pp. 296-316, 1994.
13. L. Gargano, J. Korner, and U. Vaccaro, “Sperner capacities,” Graphs Combinator., vol. 9, pp. 31-46, 1993.
14. T. Helleseth, T. Klϕve, and ϕ. Ytrehus, “Generalized Hamming weights of linear codes,” IEEE Trans. Inform. Theory, vol. 38, pp. 1133-1140, 1992.
15. G. Katona and J. Srivastava, “Minimal 2-coverings of a finite affine space based on GF(2),” J. Statistic. Planning Inference, vol. 8, pp. 375-388, 1983.
16. D. J. Kleitman and J. Spencer, “Families of k-independent sets,” Discrete Math., vol. 6, pp. 255-262, 1973.
17. J. Korner and M. Lucertini, “Compressing inconsistent data,” IEEE Trans. Inform. Theory, vol. 40, pp. 706-715, 1994.
18. A. Lempel and S. Winograd, “A new approach to error-correcting codes,” IEEE Trans. Inform. Theory, vol. 23, 1977.
19. M. Loeloeian and J. Conan, “A [55, 16, 19] binary Goppa code,” IEEE Trans Inform. Theory, vol. IT-30, p. 773, 1984.
20. L. Lovasz, “On the ratio of optimal integral and fractional covers,” Discrete Math., vol. 13, pp. 383-390, 1975.
21. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977.
22. D. Miklos, “Linear binary codes with intersection properties,” Discrete Appl. Math., vol. 9, pp. 187-196, 1984.
23. C. J. Moreno and O. Moreno, “Exponential sums and Goppa codes: II,” IEEE Trans. Inform. Theory, vol. 38, pp. 1222-1229, 1992.
24. J. Naor and M. Naor, “Small bias probability spaces: Efficient constructions and applications,” in Proc. 22nd STOC, 1990, pp. 213-223.
25. A. Renyi, Foundations of Probability. New York: Wiley, 1971.
26. C. T. Retter, “Intersecting Goppa codes,” IEEE Trans. Inform. Theory, vol. 35, pp. 822-829, 1989.
27. C. T. Retter, “The average binary weight-enumerator for a class of generalized Reed-Solomon codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 1412-1418, 1991.
28. G. Roux, “k-propriétés dans des tableaux de n colonnes; cas particulier de la k-surjectivité et de la k-permutivité, Ph.D. dissertation, Universite Paris VI, 1987.
29. G. Seroussi and N. H. Bshouty, “Vector sets for exhaustive testing of logic circuits,” IEEE Trans. Inform. Theory, vol. 34, pp. 513-521, 1988.
30. N. J. A. Sloane, “Covering arrays and intersecting codes,” J. Combinator. Designs, vol. 1, pp. 51-63, 1993.
31. S. K. Stein, “Two combinatorial covering theorems, J. Comb. Theory A, vol. 16, pp. 391-397, 1974.
32. M. A. Tsfasman, “Algebraic-geometric codes and asymptotic problems,” Discrete Appl. Math., vol. 33, pp. 241-256, 1991.
33. V. K. Wei, “Generalized Hamming weights for linear codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 1412-1418, 1991.
34. T. Yaghoobian and I. F. Blake, “Hermitian codes as generalized Reed-Solomon codes,” Designs, Codes, and Cryptography, vol. 2, pp. 5-17, 1992.
35. G. Zémor and G. Cohen, “The threshold probability of a code,” IEEE Trans. Inform. Theory, to appear.
36. G. Zémor and G. Cohen, “Applications of coding theory to interconnection networks,” Discrete Appl. Math., vol. 37/38, pp. 553-562, 1992.