Lower Bound on Expected Communication Cost of Quantum Huffman Coding.
Anurag AnshuAnkit GargAram W. HarrowPenghui YaoPublished in: TQC (2016)
Keyphrases
- communication cost
- lower bound
- huffman coding
- data compression
- sensor networks
- run length coding
- compression ratio
- communication overhead
- data distribution
- reduce communication cost
- image compression
- optimal solution
- entropy coding
- objective function
- arithmetic coding
- compression scheme
- database
- data points
- databases
- data analysis
- high order
- wireless sensor networks
- image quality
- compression algorithm
- reconstructed image
- high quality
- subband
- processing cost
- database systems
- higher order