A quantum analog of Huffman coding
From MaRDI portal
Publication:4503601
DOI10.1109/18.850709zbMath0994.94019arXivquant-ph/9805080OpenAlexW2148891356MaRDI QIDQ4503601
Christopher A. Fuchs, Daniel Gottesman, Hoi-Kwong Lo, Samuel L. Braunstein
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/9805080
data compressionquantum communicationvariable-length codesquantum informationHuffman codinginstantaneous codes
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Efficient and exact quantum compression ⋮ A theoretical framework for quantum image representation and data loading scheme ⋮ LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY ⋮ A dynamical systems proof of Kraft–McMillan inequality and its converse for prefix-free codes
This page was built for publication: A quantum analog of Huffman coding
