Zero-error instantaneous coding of correlated sources with length constraints is NP-complete

DOI10.1109/TIT.2006.871039zbMath1320.94049OpenAlexW2120306226MaRDI QIDQ3547831

Toby Berger, Ying-On Yan

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.2006.871039

zbMATH Keywords

rectangle packingNP-complete problemKraft inequalitycorrelated sourcesprefix conditionzero-error variable-length codes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Source coding (94A29)

This page was built for publication: Zero-error instantaneous coding of correlated sources with length constraints is NP-complete