On the shannon cipher system with a capacity-limited key-distribution channel
暂无分享,去创建一个
[1] Vinod M. Prabhakaran,et al. On compressing encrypted data , 2004, IEEE Transactions on Signal Processing.
[2] Sergio Verdú,et al. Simulation of random processes and rate-distortion theory , 1996, IEEE Trans. Inf. Theory.
[3] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[4] J. L. Massey,et al. An introduction to contemporary cryptology , 1988, Proc. IEEE.
[5] Hirosuke Yamamoto. Coding theorem for secret sharing communication systems with two noisy channels , 1989, IEEE Trans. Inf. Theory.
[6] Jack K. Wolf,et al. Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.
[7] C. Parman. To code, or not to code? , 2003, The Journal of oncology management : the official journal of the American College of Oncology Administrators.
[8] Aaron D. Wyner,et al. The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.
[9] Hirosuke Yamamoto,et al. Information theory in cryptology , 1991 .
[10] Neri Merhav,et al. On joint information embedding and lossy compression , 2005, IEEE Transactions on Information Theory.
[11] Hirosuke Yamamoto. Rate-distortion theory for the Shannon cipher system , 1997, IEEE Trans. Inf. Theory.
[12] R. Gallager,et al. A New Class of Lower Bounds to Information Rates of Stationary Sources via Conditional Rate-Distortion Functions , 1973 .
[13] Hirosuke Yamamoto,et al. A coding theorem for secret sharing communication systems with two Gaussian wiretap channels , 1991, IEEE Trans. Inf. Theory.
[14] Amiram H. Kaspi,et al. Rate-distortion function when side-information may be present at the decoder , 1994, IEEE Trans. Inf. Theory.
[15] Neri Merhav. On joint coding for watermarking and encryption , 2006, IEEE Transactions on Information Theory.