Single user tracing superimposed codes
M. Csuros, Miklós Ruszinkó · 2004
We investigate the zero-error capacity region of r-out of T user multiple access OR channel. A family /spl Fscr/ subsets of [n]={1, . . . ,n} is an r-single-user-tracing superimposed code (r-SUT) if there exists such a single-user-tracing function /spl phi/: 2/sup [n]//spl rarr//spl Fscr/ that for all /spl Fscr//spl sube//spl Fscr/ with |/spl Fscr/'|/spl les/r, /spl phi/(/spl cup//sub A/spl isin///spl Fscr//sub '/A)/spl isin//spl Fscr/'. In this paper we introduce the concept of these codes and investigate bounds on their rate. We also consider disjointly r-superimposed codes.