On greedy algorithms in coding theory

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 1, 1996, Pages 2053-2057

  Cohen, G D ^a   Zemor G ^b   Litsyn, S ^c  

^a TELECOM PARISTECH   (France)

^b Department of Electrical Engineering Systems ^*

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Covering codes; Derandomization; Disjunctive arrays; Greedy algorithm; Surjective arrays

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATRIX ALGEBRA;

CODING THEORY; COVERING CODES; DERANDOMIZATION; DISJUNCTIVE ARRAYS; GREEDY ALGORITHMS; HYPERGRAPHS; SURJECTIVE ARRAYS;

ENCODING (SYMBOLS);

EID: 0030291503     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556707     Document Type: Article

References (30)

1. N. Alon, Explicit construction of exponentially sized families of k-independent sets, Discr. Math., vol. 58, pp. 191-193, 1986.
2. B. Becker and H.-U. Simon, How robust is the n-cube? Inform, and Comput., vol. 77, pp. 162-178, 1988.
3. T. Berger, Rate Distortion Theory. Englewood Cliffs, NJ: Prentice-Hall, 1971.
4. B. Böse and T. R. N. Rao, Separating and completely separating systems and fault-secure design, IEEE Trans. Comput., vol. C-29, no. 7, pp. 665-668, 1980.
5. R. Brualdi and V. Pless, Greedy codes, J. Combin. Theory (A), vol. 64, pp. 10-30, 1993.
6. G. Cohen and G. Zémor, Intersecting codes and independent families, IEEE Trans. Inform. Theory, vol. 40, no. 6, pp. 1872-1881, 1994.
7. J. H. Conway and N. J. A. Sloane, Lexicographic codes: error-correcting codes from game theory, IEEE Trans. Inform. Theory, vol. IT-32, pp. 337-348, 1986.
8. D.-Z. Du and F. K. Hwang, Combinatorial Group Testing and its Applications. Singapore: World Scientific, 1993.
9. A. G. Dyachkov and V. V. Rykov, Bounds on the length of disjunctive codes, Probl. Pered. Inform, (in Russian), vol. 18, pp. 7-13, 1982.
10. M. Dyer, T. Fenner, A. Frieze, and A. Thomason, On key storage in secure networks, J. Cryptol, vol. 8, pp. 189-200, 1995.
11. P.Erdös, P. Frankl, and Z. Fiiredi, Families of finite sets in which no set is covered by the union of two others, J. Comb. Theory. Ser. A, vol. 33, pp. 158-166, 1982.
12. ,Families of finite sets in which no set is covered by the union of r others, Israeli J. Math., vol. 51, pp. 79-89, 1985.
13. M. L. Fredman and J. Komlos, On the size of separating systems and families of perfect hash functions, S1AM J. Alg. Discr. Methods, vol. 5, pp. 538-544, 1984.
14. A. D. Friedman, R. L. Graham, and J. D. Ullman, Universal single transition time asynchronous state assignments, IEEE Trans. Comput., vol. C-18, no. 6, pp. 355-359, 1969.
15. L. Gargano, J. Körner, and U. Vaccaro, Sperner theorems on directed graphs and qualitative independence, J. Comb. Theory, Ser. A, vol. 61, pp. 173-192, 1992.
16. W. H. Kautz and R. C. Singleton, Nonrandom binary superimposed codes, IEEE Trans. Inform. Theory, vol. IT-10, pp. 363-377, 1964.
17. D. Kleitman and J. Spencer, Families of fc-independent sets, Discr. Math., vol. 6, pp. 255-262, 1973.
18. J. Körner, Fredman-Komlös bounds and information theory, SIAM J. Alg. Discr. Methods, vol. 7, pp. 560-570, 1986.
19. ,On the extremal combinatorics of the Hamming space, J. Comb. Theory (Ser. A), vol. 71, pp. 112-126, 1995.
20. J. Körner and G. Simonyi, Separating partition systems and locally different sequences, SIAM J. Discr. Math., vol. 1, no. 3, pp. 355-359, 1988.
21. L. Lovâsz, On the ratio of optimal integral and fractional covers, Discr. Math., vol. 13, pp. 383-390, 1975.
22. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
23. M Ruszinkö, On the upper bound of the size of the r-cover-free families, J. Comb. Theory, Ser. A, vol. 66, pp. 302-310, 1994.
24. Yu. L. Sagalovich, State Coding and Automata Reliability (in Russian). Moscow, USSR: Svyaz, 1975.
25. ,Complete separating systems, Probl. Pered. Inform., vol. 18, no. 2, pp. 75-82, 1982.
26. G. Seroussi and N. H. Bshouty, Vector sets for exhaustive testing of logical circuits, IEEE Trans. Inform. Theory, vol. 34, pp. 513-521, 1988.
27. N. J. A. Sloane, Covering arrays and intersecting codes, J. Des. Theory, vol. 1, pp. 51-63, 1993.
28. J. Spencer, Randomization, derandomization and antirandomization: Three games, Theor. Comput. Sei., vol. 131, 1994.
29. S. K. Stein, Two combinatorial covering problems, J. Comb. Theory, Ser. A, vol. 16, pp. 391-397, 1974.
30. R. R. Varshamov, Estimate of the number of signals in error correcting codes, Dokl. Akad. Nauk SSSR, vol. 117, pp. 739-741, 1957.