Earticle

초록

영어

The security performance problems of broadcast channel with an eavesdropper (BCE) have been studied for many years in the field of communication. Many articles have given the meaningful results. However, almost no consequent of an outer bound on BCE has been given by previous work, especially, no significant results has been given. So this paper proposes and proves an outer bound of BCE by using information entropy, and further proves this outer bound is tight in the cut-set bound by max-flow min-cut theorem. It illustrates the outer bound is meaningful. Finally, by contrasting a variety of existing results, we can get that the outer bound in this paper include (tight) in the existing outer bound of BCE in the case of not considering the eavesdropper.

목차

Abstract
 1. Introduction
 2. Preliminaries
 3. The Outer Bound of BCE
 4. The Significance of Outer Bound on BCE
 5. Consequence Analysis
 6. Conclusions
 7. Appendix
  7.1. Proof of Lemma 1
  7.2. Proof of Theorem 1
  7.3. Proof of Theorem 2
 Acknowledgements
 References

키워드

저자

• Yan Zhu [ School of Electronic, Information and Electrical Engineering Shanghai Jiaotong University Shanghai, China ]
• Xiao Chen [ School of Electronic, Information and Electrical Engineering Shanghai Jiaotong University Shanghai, China ]
• Yongkai Zhou [ School of Electronic, Information and Electrical Engineering Shanghai Jiaotong University Shanghai, China ]
• Fangbiao Li [ School of Electronic, Information and Electrical Engineering Shanghai Jiaotong University Shanghai, China ]
• Zhi Xue [ School of Electronic, Information and Electrical Engineering Shanghai Jiaotong University Shanghai, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605