Co-author(s) :

Pahlevanyan Narek

Abstract:

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].

Publisher:

ITHEA

Date of publication:

2015

Identifier:

oai:noad.sci.am:135932

ISSN:

2367-5128

Language:

English

Journal or Publication Title:

International Journal Information Content and Processing

Volume:

2

Number:

1

URL:

Additional Information:

armar@ipia.sci.am ; narek@ravcap.com

Affiliation:

Institute for Informatics and Automation Problems ; Gyumri State Pedagogical Institute

Country:

Armenia