Information Rates Achievable With Algebraic Codes on Quantum Discrete Memoryless Channels
DOI10.1109/TIT.2005.860824zbMath1309.94061arXivquant-ph/0207113MaRDI QIDQ3546981
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0207113
symplectic geometryfidelityquantum error-correcting codesquantum capacitymethod of typescompletely positive (CP) linear maps
Applications of operator theory in the physical sciences (47N50) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24) Quantum coding (general) (81P70)
Related Items (1)
This page was built for publication: Information Rates Achievable With Algebraic Codes on Quantum Discrete Memoryless Channels