Special Issue "Entropy and Information"

Guest Editor
Dr. Peter Harremoës ^*
Centrum Wiskunde & Informatica (CWI), Science Park 123, 1098 XG Amsterdam, The Netherlands
Website: http://homepages.cwi.nl/~ph/
E-mail:
^* Dr. Harremoës also serves as the Editor-in-Chief of Entropy

Submission

All papers should be submitted to entropy@mdpi.org with copy to the guest editor. To be published continuously until the deadline and papers will be listed together at the special websites. Both, research articles and review articles are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editors for announcment on this website.

Submitted papers should not have been published previously, nor be under consideration for publication elsewhere. All papers are refereed through a peer-review process. A guide for authors, sample copies and other relevant information for submitting papers are available on the Instructions for Authors page. Entropy is an international peer-reviewed quarterly journal published by Molecular Diversity Preservation International.

Please visit the Instructions for Authors page before submitting a paper. Open Access publication fees are 800 CHF per paper. English correction fees (250 CHF) will be added in certain cases (1050 CHF per paper for those papers that require extensive additional formatting and/or English corrections.).

• entropy
• information
• information theory

Title: Paradigms of Cognition
Author: Flemming Topsøe
Affiliation: University of Copenhagen, Department of Mathematical Sciences, Universitetsparken 5, 2100 Copenhagen, Denmark
Abstract: Cognition strives for knowledge} of truth. Our analysis builds on interaction which leads from truth and belief to knowledge. Different interactions are considered, each defining a particular world. Examples include the classical world, where truth is observable, black holes and mixtures of these. The observer will attempt to adapt observation strategies to the world. This involves description. Entropy is defined as minimal description effort. This in itself as well as a possible connection to coding} provides a transparent interpretation of entropy and other quantities of information. In particular, this applies to the notions of entropy now known as Tsallis entropy.

Type of Paper: Article
Title: Processing Information in Quantum Decision Theory
Authors: Vyacheslav I. Yukalov ^1,2 and Didier Sornette ^1,3
Affiliations: ¹ Department of Management, Technology and Economics, ETH Zurich, Swiss Federal Institute of Technology, Kreuzplatz 5, Zurich CH-8032, Switzerland
² Bogolubov Laboratory of Theoretical Physics, Joint Institute for Nuclear Research, Dubna 141980, Russia
³ Swiss Finance Institute, c/o University of Geneva, CH-1211 Geneva 4, Switzerland
E-Mails: yukalov@thsun1.jinr.ru; dsornette@ethz.ch
Abstract: Information processing in quantum decision theory is analyzed. It is shown that the self-consistent procedure of making decisions requires to take into account the available objective information as well as subjective feelings of the decision maker. The developed quantum decision theory avoids the paradoxes that are typical of classical decision theory. The problem is addressed of choosing the necessary and sufficient information set for making an optimal decision. The principle of minimal information in quantum decision theory is formulated.

Type of Paper: Article
Title: A Lower-Bound for the Maximin Redundancy in Pattern Coding
Author: Aurelien Garivier
Affiliation: CNRS, Telecom ParisTech, Laboratoire Laboratoire Traitement et Communication de l’Information, 75013 Paris, France; E-Mail: aurelien.garivier@telecom-paristech.fr
Abstract: We show that the maximin average redundancy in pattern coding is eventually larger than 1.84 (n / logn)^1/3 for messages of length n. This completes the results obtained recently on pattern redundancy, although it does not fill the gap between known lower- and upper-bounds. The problem of pattern coding raised much interest recently, as strongly universal codes have been proved to exist for patterns while universal message coding is impossible for memoryless sources on an infinite alphabet. The proof uses fine combinatorial results on partitions with small summands.