Dominated error correcting codes with distance two

@article{Sagols2002DominatedEC,
title={Dominated error correcting codes with distance two},
author={F. Sagols and Laura Riccio and C. Colbourn},
journal={Journal of Combinatorial Designs},
year={2002},
volume={10},
pages={294-302}
}

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… Expand