On the Hardness of Finding Optimal Multiple Preset Dictionaries
From MaRDI portal
Publication:3547386
DOI10.1109/TIT.2004.830778zbMATH Open1303.94047OpenAlexW2044877470MaRDI QIDQ3547386
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.830778
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Source coding (94A29)
Related Items (1)
This page was built for publication: On the Hardness of Finding Optimal Multiple Preset Dictionaries
