paper

Strongly Cancellative and Recovering Sets On Lattices

arXiv:0909.2817

Abstract

We use information theory to study recovering sets and strongly cancellative sets $\C_L$ on different lattices. These sets are special classes of recovering pairs and cancellative sets previously discussed in [1], [3] and [5]. We mainly focus on the lattices and . Specifically, we find upper bounds and constructions for the sets , $\C_{B_n}$, and $\C_{D_{l}^{k}}$.

arXiv comment9 pages