On the Hardness of Finding Optimal Multiple Preset Dictionaries

DOI10.1109/TIT.2004.830778zbMath1303.94047MaRDI QIDQ3547386

Michael Mitzenmacher

Publication date: 21 December 2008

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

Mathematics Subject Classification ID

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

94A29: Source coding