Multilevel Diversity Coding with Secrecy Constraints Conference Paper uri icon

abstract

  • We consider the problem of communicating multiple sources to a receiver amidst an eavesdropper. The source encoder encodes the sources and sends it through the available channels to the receiver. The eavesdropper has access to a subset of m channels (m < There are totally m sources to be communicated to the receiver with the stipulation that the receiver needs to be able to reconstruct sources {1, 2 ... k}, by accessing any subset of (m+k) channels (1k L - M)We obtain the coding rate region for the case when = 3, m = 1 and show that separate and secure encoding of sources is optimal for this problem. For the case of arbitrary m, we derive a lower bound on the sum rate and the result implies a separation scheme to achieve this lower bound. 2009 IEEE.

name of conference

  • 2009 Information Theory and Applications Workshop

published proceedings

  • 2009 Information Theory and Applications Workshop

author list (cited authors)

  • Balasubramanian, A., Liu, T., & Miller, S. L.

citation count

  • 0

complete list of authors

  • Balasubramanian, A||Liu, Tie||Miller, Scott L

publication date

  • January 2009