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...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
2017
|
| Online Access: | http://hdl.handle.net/1721.1/109878 https://orcid.org/0000-0003-3220-7682 |