Zero-error instantaneous coding of correlated sources with length constraints is NP-complete.
Ying-On YanToby BergerPublished in: IEEE Trans. Inf. Theory (2006)
Keyphrases
- np complete
- constraint satisfaction
- constraint satisfaction problems
- randomly generated
- coding scheme
- satisfiability problem
- constraint programming
- linear constraints
- error rate
- multiple sources
- conjunctive queries
- knowledge sources
- information sources
- bounded treewidth
- np complete problems
- np hard
- rate distortion theory
- global constraints
- databases
- inter frame
- bitstream
- co occurrence
- motion estimation
- data sources
- feature vectors