scholarly journals An entropy maximization problem related to optical communication (Corresp.)

1986 ◽  
Vol 32 (2) ◽  
pp. 322-326 ◽  
Author(s):  
R. McEliece ◽  
E. Rodemich ◽  
L. Swanson
Keyword(s):  
Optical Communication ◽  
Maximization Problem ◽  
Entropy Maximization

scholarly journals A Direct Link between Rényi–Tsallis Entropy and Hölder’s Inequality—Yet Another Proof of Rényi–Tsallis Entropy Maximization

Entropy ◽  
2019 ◽  
Vol 21 (6) ◽  
pp. 549 ◽  
Author(s):  
Hisa-Aki Tanaka ◽  
Masaki Nakagawa ◽  
Yasutada Oohama
Keyword(s):  
Essential Role ◽  
Optimization Problems ◽  
Hölder’S Inequality ◽  
Tsallis Entropy ◽  
Maximization Problem ◽  
Direct Link ◽  
Entropy Maximization ◽  
Hölder's Inequality ◽  
Equality Condition

The well-known Hölder’s inequality has been recently utilized as an essential tool for solving several optimization problems. However, such an essential role of Hölder’s inequality does not seem to have been reported in the context of generalized entropy, including Rényi–Tsallis entropy. Here, we identify a direct link between Rényi–Tsallis entropy and Hölder’s inequality. Specifically, we demonstrate yet another elegant proof of the Rényi–Tsallis entropy maximization problem. Especially for the Tsallis entropy maximization problem, only with the equality condition of Hölder’s inequality is the q-Gaussian distribution uniquely specified and also proved to be optimal.

An Optimization Problem Related to the Zeta-function

1986 ◽  
Vol 29 (1) ◽  
pp. 70-73 ◽  
Author(s):  
Silviu Guiasu
Keyword(s):  
Probability Distribution ◽  
Zeta Function ◽  
Unique Solution ◽  
Optimization Problem ◽  
Maximization Problem ◽  
Entropy Maximization ◽  
Riemann’S Zeta Function ◽  
Positive Integers

AbstractS. Golomb noticed that Riemann's zeta function ζ induces a probability distribution on the positive integers, for any s > 1, and studied some of its properties connected to divisibility. The object of this paper is to show that the probability distribution mentioned above is the unique solution of an entropy-maximization problem.

A Centrality Entropy Maximization Problem in Shortest Path Routing Networks

2016 ◽  
Vol 104 ◽  
pp. 1-15 ◽  
Author(s):  
Vanniyarajan Chellappan ◽  
Krishna M. Sivalingam ◽  
Kamala Krithivasan
Keyword(s):  
Shortest Path ◽  
Maximization Problem ◽  
Shortest Path Routing ◽  
Entropy Maximization

Parasitic element influence on laser driver performances for 1.3 μm fiber optical communication

1993 ◽  
Vol 3 (9) ◽  
pp. 1751-1759 ◽  
Author(s):  
N. Hassaine ◽  
K. Sauv ◽  
A. Konczykowska ◽  
R. Lefevre
Keyword(s):  
Optical Communication ◽  
Parasitic Element ◽  
Laser Driver ◽  
Fiber Optical ◽  
Fiber Optical Communication
Sign in / Sign up

Export Citation Format

Share Document