(definition)
Definition: A set of bit vectors such that no vector is a subset of a bitwise or of a small number of others.
Author: PEB
Piotr Indyk, Deterministic Superimposed Coding with Applications to Pattern Matching, Proc. 38th FOCS, pages 127-136, IEEE, 1997.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 11 July 2005.
HTML page formatted Mon Sep 11 09:46:08 2006.
Cite this as:
Paul E. Black, "superimposed code", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 11 July 2005. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/superimposedCode.html
