Pages that link to "Item:Q2509560"
From MaRDI portal
The following pages link to Kolmogorov complexity and the asymptotic bound for error-correcting codes (Q2509560):
Displaying 14 items.
- Quantum theory as a critical regime of language dynamics (Q892935) (← links)
- Information compression and Varshamov-Gilbert bound (Q1099128) (← links)
- Differential subordination and convexity criteria of integral operators (Q1698470) (← links)
- Codes as fractals and noncommutative spaces (Q1948672) (← links)
- Zipf's law and L. Levin probability distributions (Q2258210) (← links)
- Syntactic structures and code parameters (Q2364907) (← links)
- Error-correcting codes and neural networks (Q2413234) (← links)
- Griffith–Kelly–Sherman Correlation Inequalities: A Useful Tool in the Theory of Error Correcting Codes (Q3548842) (← links)
- (Q4343040) (← links)
- Asymptotically good codes have infinite trellis complexity (Q4838693) (← links)
- Asymptotic bounds for spherical codes (Q4966879) (← links)
- The complexity of error-correcting codes (Q5055921) (← links)
- Corrections to “Hash Property and Fixed-Rate Universal Coding Theorems” [Jun 10 2688-2698] (Q5271990) (← links)
- Pierced by a sun ray. An obituary of Yuri Ivanovich Manin (1937--2023) (Q6072472) (← links)