Universal noiseless coding
From MaRDI portal
Publication:4770323
DOI10.1109/TIT.1973.1055092zbMath0283.94005OpenAlexW2131024393MaRDI QIDQ4770323
Publication date: 1973
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1973.1055092
Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (13)
Jeffreys' prior is asymptotically least favorable under entropy risk ⋮ A lower-bound for the maximin redundancy in pattern coding ⋮ Algorithmic complexity of points in dynamical systems ⋮ Stochastic complexity in learning ⋮ Unnamed Item ⋮ Predicting a binary sequence almost as well as the optimal biased coin ⋮ Unnamed Item ⋮ Predictive analog-to-digital conversion for resistance to data outliers ⋮ Exponential series estimator of multivariate densities ⋮ Elimination of correlation in random codes for arbitrarily varying channels ⋮ Information-theoretic determination of minimax rates of convergence ⋮ Failure-time prediction ⋮ Bayesian predictiveness, exchangeability and sufficientness in bacterial taxonomy
This page was built for publication: Universal noiseless coding
