Related papers: Performance of polar codes for quantum and private…
Polar codes are the first class of constructive channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels. But the analysis and construction of polar codes involve the complex iterative-calculation. In…
Low-depth random circuit codes possess many desirable properties for quantum error correction but have so far only been analyzed in the code capacity setting where it is assumed that encoding gates and syndrome measurements are noiseless.…
Polar codes are the first provable capacity-achieving forward error correction (FEC) codes. In general polar codes can be decoded via either successive cancellation (SC) or belief propagation (BP) decoding algorithm. However, to date…
In this paper, we consider the problem of polar coding for block fading channels, with emphasis on those with instantaneous channel state information (CSI) at neither the transmitter nor the receiver. Our approach is to decompose a block…
Polar codes have been shown to approach capacity of symmetric binary erasure channels and also have low encoding and decoding complexity. Wireless channels are bursty in nature and a method to apply polar codes over wireless channels is…
We provide a purely quantum version of polar codes, achieving the symmetric coherent information of any qubit-input quantum channel. Our scheme relies on a recursive channel combining and splitting construction, where a two-qubit gate…
Systematic polar codes are shown to outperform non-systematic polar codes in terms of the bit-error-rate (BER) performance. However theoretically the mechanism behind the better performance of systematic polar codes is not yet clear. In…
-We develop a polar coding scheme for empirical coordination in a two-node network with a noisy link in which the input and output signals have to be coordinated with the source and the reconstruction. In the case of non-causal encoding and…
The performance of quantum error correction can be significantly improved if detailed information about the noise is available, allowing to optimize both codes and decoders. It has been proposed to estimate error rates from the syndrome…
Similar to existing codes, puncturing and shortening are two general ways to obtain an arbitrary code length and code rate for polar codes. When some of the coded bits are punctured or shortened, it is equivalent to a situation in which the…
Since a quantum measurement generally disturbs the state of a quantum system, one might think that it should not be possible for a sender and receiver to communicate reliably when the receiver performs a large number of sequential…
A polar-coded transmission (PCT) scheme with joint channel estimation and decoding is proposed for channels with unknown channel state information (CSI). The CSI is estimated via successive cancellation (SC) decoding and the constraints…
We investigate practical short-blocklength coding for the semi-deterministic binary erasure wiretap channel (BE-WTC), where the main channel to the legitimate receiver is noiseless, and the eavesdropper's channel is a binary erasure channel…
When a neural network (NN) is used to decode a polar code, its training complexity scales exponentially as the code block size (or to be precise, as a number of message bits) increases. Therefore, existing solutions that use a neural…
Applications of massive machine-type communications, such as sensor networks, smart metering, 'internet-of-things', or process and factory automation, are forecast to have great economic impact in the next five to ten years. Low-complexity…
Quantum error-correcting codes so far proposed have not worked in the presence of noise which introduces more than one bit of entropy per qubit sent through a quantum channel, nor can any code which identifies the complete error syndrome.…
We introduce a new class of circuits for constructing efficiently decodable error-correction codes, based on a recently discovered contractible tensor network. We perform an in-depth study of a particular example that can be thought of as…
Arikan's polar coding method is extended to two-user multiple-access channels. It is shown that if the two users of the channel use the Arikan construction, the resulting channels will polarize to one of five possible extremals, on each of…
Here we concerned with quantum key distribution - a way to establish common cryptographic key between several parties. The work proposes a combination between quantum key distribution and systematic polar coding (an error correction…
Real global-scale quantum communications and quantum key distribution systems cannot be implemented by the current fiber and free-space links. These links have high attenuation, low polarization-preserving capability or extreme sensitivity…