Name
Abstract | ||
|---|---|---|
The definition of $\text {k}^{th}$ -order empirical entropy of strings is extended to node-labelled binary trees: A notion of $\text {k}^{th}$ -order empirical entropy for node-labelled binary trees is proposed that is able to capture regularities in both ... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/TIT.2021.3112676 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Entropy,Binary trees,Compressors,Encoding,Vegetation,Upper bound,Grammar | Journal | 67 |
Issue | ISSN | Citations |
11 | 0018-9448 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Danny Hucke | 1 | 19 | 6.31 |
| Markus Lohrey | 2 | 0 | 0.68 |
| Louisa Seelbach Benkner | 3 | 0 | 1.69 |