Entropic Bounds on the Average Length of Codes with a Space
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914790612402176 |
|---|---|
| author | Bruno, Roberto Vaccaro, Ugo |
| author_facet | Bruno, Roberto Vaccaro, Ugo |
| contents | We consider the problem of constructing prefix-free codes in which a designated symbol, a space, can only appear at the end of codewords. We provide a linear-time algorithm to construct almost-optimal codes with this property, meaning that their average length differs from the minimum possible 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_06379 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Entropic Bounds on the Average Length of Codes with a Space Bruno, Roberto Vaccaro, Ugo Information Theory We consider the problem of constructing prefix-free codes in which a designated symbol, a space, can only appear at the end of codewords. We provide a linear-time algorithm to construct almost-optimal codes with this property, meaning that their average length differs from the minimum possible 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. |
| title | Entropic Bounds on the Average Length of Codes with a Space |
| topic | Information Theory |
| url | https://arxiv.org/abs/2405.06379 |