TY - GEN
A1 - Haroutunian Mariam
A2 - Pahlevanyan Narek
PB - ITHEA
N2 - Many information-theoretical results in practice are difficult to compute, because of the large volume of distributions. To perform computations of complex formulas of Information Theory authors have developed new module (Advanced Inftheo) for R language. For high performance the main functions of module use parallel algorithms and tools of C++ to dynamically and optimally allocate memory. In this paper we demonstrate some results of computations that are done by Advanced Inftheo module. As an example we compute and represent the lower and upper bounds of ܧ-achievable secret key rate of the biometric generated secret key sharing system obtained in [Haroutunian-Pahlevanyan, 2014]. ܧ-achievable secret key rate is the generalization of the secret key rate, studied by [IgnatenkoWillems, 2012].
L1 - http://noad.sci.am/Content/135932/ijicp02-01-p05.pdf
L2 - http://noad.sci.am/Content/135932
T1 - Experimentation of “advanced inftheo” module for “r” on the example of biometric generated secret key sharing systemExperimentation of “advanced inftheo” module for “r” on the example of biometric generated secret key sharing system
UR - http://noad.sci.am/dlibra/docmetadata?id=135932
ER -