A quantum analog of Huffman coding
From MaRDI portal
Publication:4503601
DOI10.1109/18.850709zbMath0994.94019arXivquant-ph/9805080MaRDI 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 compression; quantum communication; variable-length codes; quantum information; Huffman coding; instantaneous codes
81P68: Quantum computation
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
94A45: Prefix, length-variable, comma-free codes
Related Items
A dynamical systems proof of Kraft–McMillan inequality and its converse for prefix-free codes, A theoretical framework for quantum image representation and data loading scheme, Efficient and exact quantum compression, LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY