A lower bound on compression of unknown alphabets
type: Item
instance of: scholarly article
title: A lower bound on compression of unknown alphabets
zbMATH Open document ID: 1070.68037
author: Nikola Jevtić
author: Alon Orlitsky
author: Narayana P. Santhanam
published in: Theoretical Computer Science
publication date: 2005-04-06T00:00:00Z
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 2153189
zbMATH Keywords: Large and unknown alphabets
zbMATH Keywords: Patterns
zbMATH Keywords: Saddle point approximations
zbMATH Keywords: Hayman's theorem
zbMATH Keywords: Universal compression
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.10.038
OpenAlex ID: W2127887726
cites work: Universal Portfolios
cites work: Universal portfolios with side information
cites work: Precise Minimax Redundancy and Regret
cites work: Universal codeword sets and representations of the integers
cites work: Q5538132
cites work: Universal codes for finite sequences of integers drawn from a monotone distribution
cites work: A Generalisation of Stirling's Formula.
cites work: A unified approach to weak universal source coding
cites work: The performance of universal encoding
cites work: Speaking of Infinity
cites work: Always Good Turing: Asymptotically Optimal Probability Estimation
cites work: Universal Compression of Memoryless Sources Over Unknown Alphabets
cites work: One-way communication and error-correcting codes
cites work: Fisher information and stochastic complexity
cites work: Universal Lossless Compression With Unknown Alphabets—The Average Case
cites work: Universal sequential coding of single messages
cites work: Multi-alphabet universal coding of memoryless sources
cites work: On asymptotics of certain recurrences arising in universal coding
cites work: Special issue: Average-case analysis of algorithms
cites work: A game of prediction with expert advice
cites work: Asymptotic minimax regret for data compression, gambling, and prediction
cites work: A decision-theoretic extension of stochastic complexity and its applications to learning
DOI: 10.1016/J.TCS.2004.10.038
description: scientific article; zbMATH DE number 2153189