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
Published in:
Information Theory, IEEE Transactions on
(Volume:37
,
Issue:
4
)
Date of Publication:
Jul 1991
- Page(s):
-
1182
-
1185
- ISSN :
-
0018-9448
- INSPEC Accession Number:
-
3991279
- Digital Object Identifier :
-
10.1109/18.86970
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 August 2002
- Issue Date :
-
Jul 1991
- Sponsored by :
-
IEEE Information Theory Society