Related papers: Submartingale Property of E_0 Under The Polarizati…
We describe certain extremalities for Gallager's $E_0$ function evaluated under the uniform input distribution for binary input discrete memoryless channels. The results characterize the extremality of the $E_0(\rho)$ curves of the binary…
It is shown that for any binary-input discrete memoryless channel $W$ with symmetric capacity $I(W)$ and any rate $R <I(W)$, the probability of block decoding error for polar coding under successive cancellation decoding satisfies $P_e \le…
Let $W$ be a channel where the input alphabet is endowed with an Abelian group operation, and let $(W_n)_{n\geq 0}$ be Ar{\i}kan's channel-valued polarization process that is obtained from $W$ using this operation. We prove that the process…
It is shown that given two copies of a q-ary input channel $W$, where q is prime, it is possible to create two channels $W^-$ and $W^+$ whose symmetric capacities satisfy $I(W^-)\le I(W)\le I(W^+)$, where the inequalities are strict except…
A generalization of Ar\i kan's polar code construction using transformations of the form $G^{\otimes n}$ where $G$ is an $\ell \times \ell$ matrix is considered. Necessary and sufficient conditions are given for these transformations to…
We give a unified treatment of some inequalities that are used in the proofs of channel polarization theorems involving a binary-input discrete memoryless channel.
A polar coding scheme is introduced in this paper for the wire-tap channel. It is shown that the provided scheme achieves the entire rate-equivocation region for the case of symmetric and degraded wire-tap channel, where the weak notion of…
Channel polarization, originally proposed for binary-input channels, is generalized to arbitrary discrete memoryless channels. Specifically, it is shown that when the input alphabet size is a prime number, a similar construction to that for…
New bounds on the semantic secrecy capacity of the binary adversarial wiretap channel are established . Against an adversary which reads a $\rho_r$ fraction of the transmitted codeword and modifies a $\rho_w$ fraction of the codeword, we…
The channel polarization behavior of polar codes under noise with memory is investigated. By introducing a genie-aided channel model, we first show that the polarized subchannels still converge to extremal channels under the standard polar…
We show that there is a strong connection between Weihrauch reducibility on one hand, and provability in EL_0, the intuitionistic version of RCA_0, on the other hand. More precisely, we show that Weihrauch reducibility to the composition of…
The zero-error capacity of channels with a countably infinite input alphabet formally generalises Shannon's classical problem about the capacity of discrete memoryless channels. We solve the problem for three particular channels. Our…
A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity $I(W)$ of any given binary-input discrete memoryless channel (B-DMC) $W$. The symmetric capacity is the highest rate…
In this paper we establish some criteria to decide when a discrete memoryless channel admits a metric in such a way that the maximum likelihood decoding coincides with the nearest neighbour decoding. In particular we prove a conjecture…
Polar coding over a class of binary discrete memoryless channels with channel knowledge at the encoder is studied. It is shown that polar codes achieve the capacity of convex and one-sided classes of symmetric channels.
A transform that is universally polarizing over a set of channels with memory is presented. Memory may be present in both the input to the channel and the channel itself. Both the encoder and the decoder are aware of the input distribution,…
In this letter we present results for next-to-leading-order electroweak corrections to doubly polarised W$^+$W$^-$ production at the LHC in the fully leptonic decay channel. We model the production and the decay of two polarised W bosons in…
We show that the mismatched capacity of binary discrete memoryless channels can be improved by channel combining and splitting via Ar{\i}kan's polar transformations. We also show that the improvement is possible even if the transformed…
Let $\mathcal{W}(b)$ be a class of free Lie conformal algebras of rank $2$ with $\mathbb{C}[\partial]$-basis ${L,H}$ and relations \begin{eqnarray*} [L_\lambda L]=(\partial+2\lambda)L,\ \ [L_\lambda H]=\big(\partial+(1-b)\lambda\big)H, \ \…
The polar transformation of a binary erasure channel (BEC) can be exactly approximated by other BECs. Ar{\i}kan proposed that polar codes for a BEC can be efficiently constructed by using its useful property. This study proposes a new class…