Nonasymptotic estimates of information protection efficiency for the wire-tap channel concept
作者： Valery Korzhik , Victor Yakovlev
关键词:
摘要: In this paper we have been considered the construction of code noising for general case main channel and codes with finite block length. It can be proved that such a is equivalent to combined use ordinary error correction noiseless channel. Therefore complexity in at most correcting codes.
springer.com
sci-hub.st 参考文章(4)
A. D. Wyner, The Wire-Tap Channel Bell System Technical Journal. ,vol. 54, pp. 1355- 1387 ,(1975) , 10.1002/J.1538-7305.1975.TB02040.X
Ll. Huguet, Coding scheme for a wire-tap channel using regular codes Discrete Mathematics. ,vol. 56, pp. 191- 201 ,(1985) , 10.1016/0012-365X(85)90026-3
D. Sullivan, A fundamental inequality between the probabilities of binary subgroups and cosets IEEE Transactions on Information Theory. ,vol. 13, pp. 91- 94 ,(1967) , 10.1109/TIT.1967.1053953
Robert G. Gallager, Information Theory and Reliable Communication ,(1968)