2012 Reports : Cryptology ePrint Archive Forum
Discussion forum for Cryptology ePrint Archive reports posted in 2012. Please put the report number in the subject.
2012/022 - Section 5.1
Posted by: hadimc (IP Logged)
Date: 13 June 2012 06:31
Hello,
Page 10: Is this correct H_\infty(R|Z) = n · lg (1/(1-p_A))?
It definitely is the case when no coding is used. But generally R includes 'k<n' random bits and hence H-\infty(R|Z) \leq k · lg (1/(1 - p_A)) should hold. The code redundancy will decrease this even more... Am I missing something?
Thanks,
Hadi Ahmadi
Edited 1 time(s). Last edit at 13-Jun-2012 16:31 by hadimc.
Page 10: Is this correct H_\infty(R|Z) = n · lg (1/(1-p_A))?
It definitely is the case when no coding is used. But generally R includes 'k<n' random bits and hence H-\infty(R|Z) \leq k · lg (1/(1 - p_A)) should hold. The code redundancy will decrease this even more... Am I missing something?
Thanks,
Hadi Ahmadi
Edited 1 time(s). Last edit at 13-Jun-2012 16:31 by hadimc.
Please log in for posting a message. Only registered users may post in this forum.