Lower Bound on Expected Communication Cost of Quantum Huffman Coding

Lower Bound on Expected Communication Cost of Quantum Huffman Coding

Data compression is a fundamental problem in quantum and classical information theory. A typical version of the problem is that the sender Alice receives a (classical or quantum) state from some known ensemble and needs to transmit them to the receiver Bob with average error below some specified bou...

Full description

Bibliographic Details
Main Authors: Anshu, Anurag (Author), Garg, Ankit (Author), Yao, Penghui (Author), Harrow, Aram W (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Mathematics (Contributor), Massachusetts Institute of Technology. Department of Physics (Contributor), Massachusetts Institute of Technology. Research Laboratory of Electronics (Contributor)
Format: Article
Language:English
Published: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017-06-15T13:25:53Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items