Strengthening Simmon's bound on impersonation

Summary, in English

Simmons' lower bound on impersonation P1⩾2 -I(M;E) where M and E denote the message and the encoding rule, respectively, is strengthened by maximizing over the source statistics and by allowing dependence between the message and the encoding rule. The authors show that a refinement of their argument, which removes the assumption of independence between E and the source state S, leads to an even stronger bound

• Author: Rolf Johannesson; Andrea Sgarro
• Department/s: Department of Electrical and Information Technology
• Publishing year: 1991
• Language: English
• Pages: 1182-1185
• Publication/Series: IEEE Transactions on Information Theory
• Volume: 37
• Issue: 4
• Full text: - 410 kB; Download statistics
• Links: http://ieeexplore.ieee.org/iel1/18/2832/00086970.pdf; http://dx.doi.org/10.1109/18.86970
• Document type: Journal article
• Publisher: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Status: Published
• ISBN/ISSN/Other: ISSN: 0018-9448