Weak Superimposed Codes of Improved Asymptotic Rate and Their Randomized Construction

TL;DR

This paper improves the theoretical bounds on the asymptotic rate of weak superimposed codes and provides a randomized polynomial-time construction method that achieves these bounds with high probability.

Contribution

It establishes a tighter lower bound on the rate of weak superimposed codes and introduces a versatile randomized construction algorithm.

Findings

Proved a new lower bound on the asymptotic rate.

Developed a polynomial-time randomized construction algorithm.

Achieves codes that meet the improved rate bound with high probability.

Abstract

Weak superimposed codes are combinatorial structures related closely to generalized cover-free families, superimposed codes, and disjunct matrices in that they are only required to satisfy similar but less stringent conditions. This class of codes may also be seen as a stricter variant of what are known as locally thin families in combinatorics. Originally, weak superimposed codes were introduced in the context of multimedia content protection against illegal distribution of copies under the assumption that a coalition of malicious users may employ the averaging attack with adversarial noise. As in many other kinds of codes in information theory, it is of interest and importance in the study of weak superimposed codes to find the highest achievable rate in the asymptotic regime and give an efficient construction that produces an infinite sequence of codes that achieve it. Here, we prove a tighter lower bound than the sharpest known one on the rate of optimal weak superimposed codes and give a polynomial-time randomized construction algorithm for codes that asymptotically attain our improved bound with high probability. Our probabilistic approach is versatile and applicable to many other related codes and arrays.