(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. DOI: 10.1109/SFCS.1997.646101
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 6 May 2019.
HTML page formatted Mon May 6 10:22:33 2019.
Cite this as:
Paul E. Black, "superimposed code", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 6 May 2019. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/superimposedCode.html