Entropic Bounds on the Average Length of Codes with a Space

Entropic Bounds on the Average Length of Codes with a Space

We consider the problem of constructing prefix-free codes in which a designated symbol, a , can only appear at the end of codewords. We provide a linear-time algorithm to construct -optimal codes with this property, meaning that their average length differs from the by at most one. We obtain our res...

Full description

Saved in:
Bibliographic Details
Published in:Entropy (Basel, Switzerland) Vol. 26; no. 4; p. 283
Main Authors: Bruno, Roberto, Vaccaro, Ugo
Format: Journal Article
Language:English
Published: Switzerland MDPI AG 01-04-2024
Subjects:
Algorithms
Analysis
average length
Codes
Coding theory
Entropy
Hypotheses
Information theory
Lower bounds
Methods
one-to-one codes
prefix-free codes
Probability
Probability distribution
Source code
Italy
codes
entropy
prefix-free codes
one-to-one codes
average length
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider the problem of constructing prefix-free codes in which a designated symbol, a , can only appear at the end of codewords. We provide a linear-time algorithm to construct -optimal codes with this property, meaning that their average length differs from the by at most one. We obtain our results by uncovering a relation between our class of codes and the class of one-to-one codes. Additionally, we derive upper and lower bounds to the average length of optimal prefix-free codes with a space in terms of the source entropy.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1099-4300
1099-4300
DOI:10.3390/e26040283