Coding theorem for secret sharing communication systems with two noisy channels

Abstract

The coding theorem is proved for the secret sharing communication system (SSCS) with two noisy channels, each of which is a broadcast channel characterized by P( y,z, Ix,), j = 1,2; it is assumed that the legitimate channel ( Xj + Y,) is less noisy than the wiretapped channel ( Xj --f Z,), The code (f, +) for the SSCS is defined by two mappings: (Xp,Xp)=f… (More)
DOI: 10.1109/18.30979

Topics

3 Figures and Tables

Cite this paper

@article{Yamamoto1989CodingTF, title={Coding theorem for secret sharing communication systems with two noisy channels}, author={Hirosuke Yamamoto}, journal={IEEE Trans. Information Theory}, year={1989}, volume={35}, pages={572-578} }