Application of Hölder's inequality in information theory.

DOI10.1016/S0020-0255(02)00300-6zbMath1042.94007OpenAlexW2043832244MaRDI QIDQ1425261

D. Massart

Publication date: 15 March 2004

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(02)00300-6

zbMATH Keywords

Hölder inequalityinformation measureuniquely decipherable codecoding theoremexponential mean length of code wordsmean code words length

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)

Related Items

A new weighted \((\alpha, \beta)\)-norm information measure with application in coding theory ⋮ Some estimations of the Jensen difference and applications ⋮ Some Coding Theorems Based on Three Types of the Exponential Form of Cost Functions ⋮ New property of a generalized Hölder's inequality and its applications ⋮ Some source coding theorems and 1:1 coding based on generalized inaccuracy measure of order \(\alpha \) and type \(\beta \) ⋮ Reversed version of a generalized sharp Hölder's inequality and its applications ⋮ Development of two new mean codeword lengths ⋮ A unified characterization of generalized information and certainty measures

Cites Work

• The R-norm information measure
• A Noiseless Coding Theorem for Sources Having Utilities
• A coding theorem and Rényi's entropy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Application of Hölder's inequality in information theory.