Simultaneous communication in noisy channels

A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The channel in which the message is sent has noise for each of the users (possibly different noise for different users), who cannot distinguish between some pairs of letters. The vector (m1, m2, . . . , mr)(n) is said to be feasible if length n encoding and decoding schemes exist enabling every user to decode his message. A rate vector (R1, R2, . . . , Rr) is feasible if there exists a sequence of feasible vectors (m1, m2, . . . , mr)(n) such that (R1, . . . , Rr) = limn(log2 m1 n , . . . , log2 mr n ). In this work we investigate which rate vectors are feasible for several different scenarios and describe some of their properties. The maximum total rate, which is defined to be the sum of all users' rates, is an additional parameter for which we give lower and upper bounds. An interesting case we discuss is whe...

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Amit Weinstein
• Keywords: CORR 2010, Education, Possible Mi Messages, Rate Vectors, User