Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels

DOI10.1109/TIT.2017.2726555zbMATH Open1373.81162arXiv1401.6039MaRDI QIDQ4589396FDOQ4589396

Marco Dalai, Andreas Winter

Publication date: 10 November 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: The sphere packing bound, in the form given by Shannon, Gallager and Berlekamp, was recently extended to classical-quantum channels, and it was shown that this creates a natural setting for combining probabilistic approaches with some combinatorial ones such as the Lov'asz theta function. In this paper, we extend the study to the case of constant composition codes. We first extend the sphere packing bound for classical-quantum channels to this case, and we then show that the obtained result is related to a variation of the Lov'asz theta function studied by Marton. We then propose a further extension to the case of varying channels and codewords with a constant conditional composition given a particular sequence. This extension is then applied to auxiliary channels to deduce a bound which can be interpreted as an extension of the Elias bound.

Full work available at URL: https://arxiv.org/abs/1401.6039

Mathematics Subject Classification ID

Quantum coding (general) (81P70) Combinatorial codes (94B25)

Cited In (4)

• The sphere packing bound for memoryless channels
• Reliability function of quantum information decoupling via the sandwiched Rényi divergence
• A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
• Properties of noncommutative Rényi and Augustin information

This page was built for publication: Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589396)