Strongly Cancellative and Recovering Sets On Lattices

Details Strongly Cancellative and Recovering Sets On Lattices Strongly Cancellative and Recovering Sets On Lattices

2009-09-15

arxiv.org/abs/0909.2817v1

Mathematics

Combinatorics

9 pages

Scientific paper

We use information theory to study recovering sets $\R_L$ 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 $B_n$ and $D_{l}^{k}$. Specifically, we find upper bounds and constructions for the sets $\R_{B_n}$, $\C_{B_n}$, and $\C_{D_{l}^{k}}$.

Affiliated with

Also associated with

No associations

Rating

Strongly Cancellative and Recovering Sets On Lattices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Strongly Cancellative and Recovering Sets On Lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strongly Cancellative and Recovering Sets On Lattices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556022