Polar codes for arbitrary classical-quantum channels and arbitrary cq-MACs
METADATA ONLY
Loading...
Author / Producer
Date
2017
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
We prove polarization theorems for arbitrary classical-quantum (cq) channels. The input alphabet is endowed with an arbitrary Abelian group operation and an Arikan-style transformation is applied using this operation. It is shown that as the number of polarization steps becomes large, the synthetic cq-channels polarize to deterministic homomorphism channels that project their input to a quotient group of the input alphabet. This result is used to construct polar codes for arbitrary cq-channels and arbitrary classical-quantum multiple access channels (cq-MAC). The encoder can be implemented in O(N log N) operations, where N is the blocklength of the code. A quantum successive cancellation decoder for the constructed codes is proposed. It is shown that the probability of error of this decoder decays faster than 2 -Nβ for any β <; ½.
Permanent link
Publication status
published
External links
Editor
Book title
2017 IEEE International Symposium on Information Theory (ISIT)
Journal / series
Volume
Pages / Article No.
281 - 285
Publisher
IEEE
Event
2017 IEEE International Symposium on Information Theory (ISIT 2017)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
03781 - Renner, Renato / Renner, Renato