Description
A set of binary strings with the property that the bitwise OR of any subset of at most \(s\) codewords uniquely identifies that subset, for some prescribed strength \(s\). Equivalently, in the associated family of supports, no codeword support is contained in the union of \(s\) others [4][5; Thm. 1.2].Member of code lists
Primary Hierarchy
References
- [1]
- Mooers, Calvin N. “Application of random codes to the gathering of statistical information.” PhD diss., Massachusetts Institute of Technology, 1948.
- [2]
- G. OROSZ and L. TAKÁCS, “SOME PROBABILITY PROBLEMS CONCERNING THE MARKING OF CODES INTO THE SUPERIMPOSITION FIELD”, Journal of Documentation 12, 231 (1956) DOI
- [3]
- S. Stiassny, “Mathematical analysis of various superimposed coding methods”, American Documentation 11, 155 (1960) DOI
- [4]
- W. Kautz and R. Singleton, “Nonrandom binary superimposed codes”, IEEE Transactions on Information Theory 10, 363 (1964) DOI
- [5]
- R. Wei, “On Cover-Free Families”, (2023) arXiv:2303.17524
- [6]
- C. Faloutsos, “Access methods for text”, ACM Computing Surveys 17, 49 (1985) DOI
- [7]
- P. Indyk, “Deterministic superimposed coding with applications to pattern matching”, Proceedings 38th Annual Symposium on Foundations of Computer Science 127 DOI
- [8]
- Vadim Okun, “Dictionary of Algorithms and Data Structures (DADS)”, (2024) DOI
Page edit log
- Victor V. Albert (2024-08-18) — most recent
Cite as:
“Superimposed code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/superimposed