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ász 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ász 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 finally applied to auxiliary channels to deduce a bound, which is useful in the low rate region and which can be interpreted as an extension of the Elias bound.
Original language | English |
---|---|
Article number | 7979569 |
Pages (from-to) | 5603-5617 |
Number of pages | 15 |
Journal | IEEE Transactions on Information Theory |
Volume | 63 |
Issue number | 9 |
DOIs | |
State | Published - Sep 2017 |
Externally published | Yes |
Keywords
- Quantum channels
- constant composition codes
- error exponents
- sphere packing bound
- zero-error capacity