Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013, Article ID 423619, 17 pages
http://dx.doi.org/10.1155/2013/423619
Research Article

Wiretap Channel in the Presence of Action-Dependent States and Noiseless Feedback

1School of Information Science and Technology, Southwest JiaoTong University, Chengdu 610031, China
2Institute for Experimental Mathematics, Duisburg-Essen University, Ellernstraße 29, 45326 Essen, Germany
3Computer Science and Engineering Department, Shanghai Jiao Tong University, Shanghai 200240, China

Received 29 November 2012; Accepted 3 January 2013

Academic Editor: Jin Liang

Copyright © 2013 Bin Dai et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. D. Wyner, “The wire-tap channel,” The Bell System Technical Journal, vol. 54, no. 8, pp. 1355–1387, 1975. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. I. Csiszár and J. Körner, “Broadcast channels with confidential messages,” IEEE Transactions on Information Theory, vol. 24, no. 3, pp. 339–348, 1978. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. J. Körner and K. Marton, “General broadcast channels with degraded message sets,” IEEE Transactions on Information Theory, vol. 23, no. 1, pp. 60–64, 1977. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. N. Merhav, “Shannon's secrecy system with informed receivers and its application to systematic coding for wiretapped channels,” IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2723–2734, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  5. R. Ahlswede and N. Cai, “Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder,” in General Theory of Information Transfer and Combinatorics, vol. 4123 of Lecture Notes in Computer Science, pp. 258–275, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. B. Dai, A. J. Han Vinck, Y. Luo, and Z. Zhuang, “Capacity region of non-degraded wiretap channel with noiseless feedback,” in Proceedings of the IEEE International Symposium on Information Theory, Cambridge, Mass, USA, July 2012.
  7. L. Lai, H. El Gamal, and H. V. Poor, “The wiretap channel with feedback: encryption over the channel,” IEEE Transactions on Information Theory, vol. 54, no. 11, pp. 5059–5067, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  8. E. Ardestanizadeh, M. Franceschetti, T. Javidi, and Y.-H. Kim, “Wiretap channel with secure rate-limited feedback,” IEEE Transactions on Information Theory, vol. 55, no. 12, pp. 5353–5361, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  9. G. Chen and C. Chang, “A construction for secret sharing scheme with general access structure,” Journal of Information Hiding and Multimedia Signal Processing, vol. 4, no. 1, pp. 1–8, 2013. View at Google Scholar
  10. R. Nishimura, S. Abe, N. Fujita, and Y. Suzuki, “Reinforcement of VoIP security with multipath routing and secret sharing scheme,” Journal of Information Hiding and Multimedia Signal Processing, vol. 1, no. 3, pp. 204–219, 2010. View at Google Scholar
  11. Z. Wang, C. Chang, H. N. Tu, and M. Li, “Sharing a secret image in binary images with verification,” Journal of Information Hiding and Multimedia Signal Processing, vol. 2, no. 1, pp. 78–90, 2011. View at Google Scholar
  12. C. E. Shannon, “Channels with side information at the transmitter,” IBM Journal of Research and Development, vol. 2, pp. 289–293, 1958. View at Google Scholar · View at MathSciNet
  13. A. V. Kuznecov and B. S. Cybakov, “Coding in a memory with imperfect cells,” Problemy Peredachi Informatsii, vol. 10, no. 2, pp. 52–60, 1974. View at Google Scholar · View at MathSciNet
  14. S. I. Gel'efand and M. S. Pinsker, “Coding for channel with random parameters,” Problems of Control and Information Theory, vol. 9, no. 1, pp. 19–31, 1980. View at Google Scholar · View at MathSciNet
  15. M. H. M. Costa, “Writing on dirty paper,” IEEE Transactions on Information Theory, vol. 29, no. 3, pp. 439–441, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. T. Weissman, “Capacity of channels with action-dependent states,” IEEE Transactions on Information Theory, vol. 56, no. 11, pp. 5396–5411, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  17. C. Mitrpant, A. J. Han Vinck, and Y. Luo, “An achievable region for the Gaussian wiretap channel with side information,” IEEE Transactions on Information Theory, vol. 52, no. 5, pp. 2181–2190, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  18. Y. Chen and A. J. H. Vinck, “Wiretap channel with side information,” IEEE Transactions on Information Theory, vol. 54, no. 1, pp. 395–402, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  19. B. Dai and Y. Luo, “Some new results on wiretap channel with side information,” Entropy, vol. 14, pp. 1671–1702, 2012. View at Google Scholar
  20. I. Csiszár and J. Körner, Information Theory, Probability and Mathematical Statistics, Academic Press, London, UK, 1981. View at MathSciNet