相关论文: Source and Channel Polarization over Finite Fields…
Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. Just as with "usual" polar codes, the block error probability under successive cancellation decoding is…
Optical fibers constitute an attractive platform for the realization of nonlinear and quantum optics processes. Here we show, through theoretical considerations, how polarization effects of both third-order parametric down-conversion and…
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 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,…
Being attracted by the property of classical polar code, researchers are trying to find its analogue in quantum fields, which is called quantum polar code. The first step and the key to design quantum polar code is to find out for the…
In this paper, motivated by the work of Chapman, Vsemirnov and Sun et al., we investigate some arithmetic properties of the generalized Legendre matrices over finite fields. For example, letting $a_1,\cdots,a_{(q-1)/2}$ be all non-zero…
Komj\'ath, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in their compactness theorem that those matroids always admit…
Arikan's recursive code construction is designed to polarize a collection of memoryless channels into a set of good and a set of bad channels, and it can be efficiently decoded using successive cancellation. It was recently shown that the…
Deformations in piezoelectric materials lead to conduction effects, which are due to two contributions: the relative displacements of the ionic cores, and the so-called orbital polarization. This work is devoted to the rigorous derivation…
Polar codes were originally specified for codelengths that are powers of two. In many applications, it is desired to have a code that is not restricted to such lengths. Two common strategies of modifying the length of a code are shortening…
The polarization of radiation by scattering on an atom embedded in combined external quadrupole electric and uniform magnetic fields is studied theoretically. Limiting cases of scattering under Zeeman effect and Hanle effect in weak…
Recently, there has been a revival of interest in mechanisms for changing the spin polarization of an electron beam on transmission through, or reflection from, a magnetic surface. An understanding of these mechanisms would allow the use of…
A framework is proposed that allows for a joint description and optimization of both binary polar coding and $2^m$-ary digital pulse-amplitude modulation (PAM) schemes such as multilevel coding (MLC) and bit-interleaved coded modulation…
Polar codes that approach capacity at a near-optimal speed, namely with scaling exponents close to $2$, have been shown possible for $q$-ary erasure channels (Pfister and Urbanke), the BEC (Fazeli, Hassani, Mondelli, and Vardy), all BMS…
The creation and detection of atomic polarization is examined theoretically, through the study of basic optical-pumping mechanisms and absorption and fluorescence measurements, and the dependence of these processes on the size of ground-…
Radiation emitted by unpolarized high-energy electrons penetrating crystals may be linearly polarized. This occurs when the particle velocity makes an angle, with respect to some major crystal axis, being sufficiently larger than the…
For a binary-input memoryless symmetric channel $W$, we consider the asymptotic behavior of the polarization process in the large block-length regime when transmission takes place over $W$. In particular, we study the asymptotics of the…
Polar codes are constructed for m-user multiple access channels (MAC) whose input alphabet size is a prime number. The block error probability under successive cancelation decoding decays exponentially with the square root of the block…
Polarization radiation arising when a charged particle moves uniformly in vacuum nearby the media possessing a finite permittivity $\epsilon (\omega) = \epsilon^{\prime} + i \epsilon^{\prime \prime}$ and sharp boundaries is considered. The…
We propose a scheme that universally achieves the smallest possible compression rate for a class of sources with side information, and develop an application of this result for a joint source channel coding problem over a broadcast channel.