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
5 Citations
On Block Sequences of Steiner Quadruple Systems with Error Correcting Consecutive Unions
  • PDF
Cyclic sequences of k-subsets with distinct consecutive unions
  • 3
  • PDF
Consecutive positive detectable matrices and group testing for consecutive positives
  • 12

References

SHOWING 1-6 OF 6 REFERENCES
Solution of some multi-dimensional lattice path parity difference recurrence relations
  • 9
A Survey of Combinatorial Gray Codes
  • C. Savage
  • Computer Science, Mathematics
  • SIAM Rev.
  • 1997
  • 425
  • PDF
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings
  • 686
Finding parity difference by involutions
  • 2
Combinatorial algorithms: generation, enumeration, and search
  • 444
Group testing for consecutive positives
  • 25
  • PDF