Dominated error correcting codes with distance two

Journal of Combinatorial Designs

Volumn 10, Issue 5, 2002, Pages 294-302

  Sagols, Feliú ^a   Riccio, Laura P ^b   Colbourn, Charles J ^c  

^a DEPARTAMENTO DE FÍSICA   (Mexico)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Arizona State University   (United States)

Author keywords

Error correcting code; Hamiltonian cycle; Nonadaptive group testing

Indexed keywords

EID: 0345017666     PISSN: 10638539     EISSN: 15206610     Source Type: Journal    
DOI: 10.1002/jcd.10012     Document Type: Article

References (7)

1. D. Angluin and L. G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J Comp Syst Sci 18 (1979), 155-193. (Pubitemid 9461409)
2. C. J. Colbourn, Group testing for consecutive positives, Ann Combin 3 (1999), 37-41.
3. D. Z. Du and F. K. Hwang, Combinatorial Group Testing, World Scientific, Singapore, 1993.
4. C. W. Ko and F. Ruskey, Solution of some multidimensional path parity difference recurrence relations, Discrete Math 71 (1988), 47-56.
5. D. L. Kreher and D. R. Stinson, Combinatorial Algorithms: Generation, Enumeration and Search, CRC Press, Boca Raton FL, 1998.
6. C. Savage, A survey of combinatorial Gray codes, SIAM Rev 39 (1997), 605-629.
7. G. Stachowiak, Finding parity difference by involutions, Discrete Math 163 (1997), 139-151. (Pubitemid 127418428)