Pages that link to "Item:Q1316114"
From MaRDI portal
The following pages link to A note on the number of \(N\)-bit strings with maximum complexity (Q1316114):
Displaying 6 items.
- On the Varshamov-Tenengolts construction on binary strings (Q393366) (← links)
- New applications of the incompressibility method. II (Q1978700) (← links)
- Maximizing T-complexity (Q2804173) (← links)
- Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity (Q2921012) (← links)
- Asymptotic Optimality of Antidictionary Codes (Q5485307) (← links)
- Maximal unbordered factors of random strings (Q5916287) (← links)