Related papers: Source and Channel Polarization over Finite Fields…
We show that any pure, two-mode, $N$-photon state with $N$ odd or equal to two can be transformed into an orthogonal state using only linear optics. According to a recently suggested definition of polarization degree, this implies that all…
We generalized the conventional concept of q-plate, allowing in its definition non linear functions of the azimuthal coordinate, and simulated the resulting fields of applying this kind of element to uniformly polarized input beams, both in…
A scheme for concatenating the recently invented polar codes with interleaved block codes is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation scheme captures the…
We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-achieving rate-compatible polar codes for a degraded family…
Each memoryless binary-input channel (BIC) can be uniquely described by its Blackwell measure, which is a probability distribution on the unit interval $[0,1]$ with mean $1/2$. Conversely, any such probability distribution defines a BIC.…
Though network coding is traditionally performed over finite fields, recent work on nested-lattice-based network coding suggests that, by allowing network coding over certain finite rings, more efficient physical-layer network coding…
We report circular-to-linear and linear-to-circular conversion of optical polarization by semiconductor quantum dots. The polarization conversion occurs under continuous wave excitation in absence of any magnetic field. The effect…
We prove two results on the universality of polar codes for source coding and channel communication. First, we show that for any polar code built for a source $P_{X,Z}$ there exists a slightly modified polar code - having the same rate, the…
The problem of polar coding for an arbitrary sequence of independent binary-input memoryless symmetric (BMS) channels $\left\{W_i\right\}_{i=1}^{N}$ is considered. The sequence of channels is assumed to be completely known to both the…
For a field extension $L/K$ we consider maps that are quadratic over $L$ but whose polarisation is only bilinear over $K$. Our main result is that all such are automatically quadratic forms over $L$ in the usual sense if and only if $L/K$…
Within the framework of mappings between affine spaces, the notion of $n$-th polarization of a function will lead to an intrinsic characterization of polynomial functions. We prove that the characteristic features of derivations, such as…
The Additive-Multiplicative Matrix Channel (AMMC) was introduced by Silva, Kschischang and K\"otter in 2010 to model data transmission using random linear network coding. The input and output of the channel are $n\times m$ matrices over a…
We prove that, for all binary-input symmetric memoryless channels, polar codes enable reliable communication at rates within $\epsilon > 0$ of the Shannon capacity with a block length, construction complexity, and decoding complexity all…
We give an explicit necessary condition for pairs of orders in a quartic CM-field to have the same polarised class group. This generalises a simpler result for imaginary quadratic fields. We give an application of our results to computing…
Polarization is a basic property of light and is fundamentally linked to the internal geometry of a source of radiation. Polarimetry complements photometric, spectroscopic, and imaging analyses of sources of radiation and has made possible…
Polar coding, introduced 2008 by Arikan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the…
We consider directed acyclic {\em sum-networks} with $m$ sources and $n$ terminals where the sources generate symbols from an arbitrary alphabet field $F$, and the terminals need to recover the sum of the sources over $F$. We show that for…
We study polar coding for stochastic processes with memory. For example, a process may be defined by the joint distribution of the input and output of a channel. The memory may be present in the channel, the input, or both. We show that…
The Stokes parameters have been found in the framework of quantum electrodynamics for the description of polarization of radiation emitted by relativistic positrons channeled between (110) planes in Si crystal. The degree of polarization,…
The polarization of light is critical in various applications, including quantum communication, where the photon polarization encoding a qubit can undergo uncontrolled changes when transmitted through optical fibers. Bends in the fiber,…