Abstract
We study the hamiltonicity of certain graphs obtained from the hypercube as a means of producing a binary code of distance two and length n, whose codewords are ordered so that for each two consecutive codewords, one dominates the other. One vector dominates the other, if and only if, in all the positions where one of them has a zero, the other has a zero too. These dominated codes have applications in group testing for consecutive defectives. We also determine when the vectors can be ordered so that every two consecutive vectors have the domination property, and are at distance two; this is a natural generalization of Gray codes.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 294-302 |
| Number of pages | 9 |
| Journal | Journal of Combinatorial Designs |
| Volume | 10 |
| Issue number | 5 |
| DOIs | |
| State | Published - Dec 1 2002 |
Keywords
- Error correcting code
- Hamiltonian cycle
- Nonadaptive group testing
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
Fingerprint Dive into the research topics of 'Dominated error correcting codes with distance two'. Together they form a unique fingerprint.
Cite this
Sagols, F., Riccio, L. P., & Colbourn, C. (2002). Dominated error correcting codes with distance two. Journal of Combinatorial Designs, 10(5), 294-302. https://doi.org/10.1002/jcd.10012