On a coding theorem connected with entropy of order \(\alpha\) and type \(\beta\)

DOI10.1016/0020-0255(83)90046-4zbMath0582.94011OpenAlexW2026537952MaRDI QIDQ1069903

Gur Dial

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0020-0255(83)90046-4

zbMATH Keywords

inaccuraciesaverage length of code wordsentropy of order alpha and type betageneralizations of Shannon's inequalityRenyi-entropyShannon-entropyuniquely decipherable codes

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Information theory (general) (94A15) Systems of functional equations and inequalities (39B72) Coding theorems (Shannon theory) (94A24)

Related Items (1)

Some inequalities in information theory using Tsallis entropy

Cites Work

• On measures of information and their characterizations
• On a coding theorem connected with Rényi's entropy
• A generalization of shannon's inequality and its application in coding theory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a coding theorem connected with entropy of order \(\alpha\) and type \(\beta\)