Uniqueness of some optimal superimposed codes
Sungpyo Hong, Stoyan Kapralov, H. K. Kim, Dong Yeol Oh · Problems of Information Transmission · 2007
Four new results on the uniqueness of optimal superimposed codes are presented, namely, the uniqueness of (w, r) superimposed codes of size N × T with $$N = \left( {\begin{array}{*{20}c} {w + r + 1} \\ w \\ \end{array} } \right)$$ and T = w + r + 1 and the uniqueness of (2, 2) superimposed codes of size 18 × 9, (2, 2) superimposed codes of size 14 × 7, and (3, 3) superimposed codes of size 66 × 11.