Strongly cancellative and recovering sets on lattices (Q540066)

Summary: We use information theory to study recovering sets \(\mathbf R_L\) and strongly cancellative sets \(\mathbf C_L\) on different lattices. These sets are special classes of recovering pairs and cancellative sets previously discussed in papers of Simonyi, Frankl, and Füredi. We mainly focus on the lattices \(B_n\) and \(D^k_l\). Specifically, we find upper bounds and constructions for the sets \(\mathbf R_{B_n}, \mathbf C_{B_n}\), and \(\mathbf C_{D^k_l}\)