Source coding, large deviations, and approximate pattern matching
From MaRDI portal
Publication:4674528
DOI10.1109/TIT.2002.1003841zbMath1061.94016arXivmath/0103007MaRDI QIDQ4674528
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0103007
Pattern recognition, speech recognition (68T10) Large deviations (60F10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)
Related Items (7)
Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources ⋮ Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases ⋮ Random databases with approximate record matching ⋮ On approximate pattern matching for a class of Gibbs random fields ⋮ Cramér’s Theorem is Atypical ⋮ Probabilities of randomly centered small balls and quantization in Banach spaces ⋮ Asymptotic behavior of the distortion-rate function for Gaussian processes in Banach spaces
This page was built for publication: Source coding, large deviations, and approximate pattern matching
