Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.03816 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- We establish diverse relationships between the algorithmic (Kolmogorov) complexity of the prefixes of any binary expansion and $β$-expansions. These relationships allow to develop intuitions on the complexity behavior of $β$-expansions, and raise problems related to compressibility of binary sequences generated in the context of A/D conversion relying on $β$-expansions. Our last contribution is to solve these problems.