Universal codes for finite sequences of integers drawn from a monotone distribution
From MaRDI portal
Publication:4674538
DOI10.1109/TIT.2002.1003851zbMath1061.94019MaRDI QIDQ4674538
Abraham J. Wyner, Dean P. Foster, Robert A. Stine
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)
Related Items (3)
α-Investing: a Procedure for Sequential Control of Expected False Discoveries ⋮ A lower bound on compression of unknown alphabets ⋮ General empirical Bayes wavelet methods and exactly adaptive minimax estimation
This page was built for publication: Universal codes for finite sequences of integers drawn from a monotone distribution