Optimisation of information processes using non-extensive entropies without parameters Online publication date: Thu, 29-Sep-2022
by Jesús Fuentes; Octavio Obregón
International Journal of Information and Coding Theory (IJICOT), Vol. 6, No. 1, 2022
Abstract: As a non-extensive statistical mechanics application, a possible path to generalised information theory is discussed by introducing a family of non-extensive entropies dependent solely on probability: HD±(P). In this scheme, two regimes of probabilities are possible; while the low-probability region exactly coincides with standard information theory, the high-probability regime offers further optimisation in certain information approaches. In this work, we explore two fundamental processes. Firstly, we propose generalisations to Shannon's coding theorems by modifying the ordinary Kraft inequality. This modification will ensure the codes to be uniquely decipherable in the framework of entropies HD±(P). Secondly, we calculate the channel capacity of a binary symmetric channel (BSC) and a binary erasure channel (BEC). Our results suggest an improvement in data compression and transmission with respect to the standard formulation.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Coding Theory (IJICOT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook