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
- Mathematics, Computer Science
- SIAM J. Discret. Math.
- 2009
- PDF
Cyclic sequences of k-subsets with distinct consecutive unions
- Computer Science, Mathematics
- Discret. Math.
- 2008
- 3
- PDF
Some constructions for block sequences of steiner quadruple systems with error correcting consecutive unions
- Mathematics
- 2008
- 2
Consecutive positive detectable matrices and group testing for consecutive positives
- Computer Science, Mathematics
- Discret. Math.
- 2004
- 12
References
SHOWING 1-6 OF 6 REFERENCES
Solution of some multi-dimensional lattice path parity difference recurrence relations
- Computer Science, Mathematics
- Discret. Math.
- 1988
- 9
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings
- Computer Science, Mathematics
- J. Comput. Syst. Sci.
- 1979
- 686
Combinatorial algorithms: generation, enumeration, and search
- Mathematics, Computer Science
- SIGA
- 1999
- 444