Speaking of Infinity

DOI10.1109/TIT.2004.834734MaRDI QIDQ3547437zbMATH OpenOpenAlexFDO

Authors Alon Orlitsky, Narayana P. Santhanam

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2004.834734

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Recommendations

• Universal Compression of Memoryless Sources Over Unknown Alphabets
• A lower bound on compression of unknown alphabets
• Universal Compression of Markov and Related Sources Over Arbitrary Alphabets
• Universal Lossless Compression With Unknown Alphabets—The Average Case
• On the MDL principle for i.i.d. sources with large alphabets

Cited in

(5)

• A lower bound on compression of unknown alphabets
• Universal Compression of Memoryless Sources Over Unknown Alphabets
• Universal Compression of Markov and Related Sources Over Arbitrary Alphabets
• Precise minimax regret for logistic regression with categorical feature values
• A lower-bound for the maximin redundancy in pattern coding

This page was built for publication: Speaking of Infinity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547437)