Related papers: Probabilistic Shaping and Non-Binary Codes
Signal shaping is vital to approach Shannon's capacity, yet it is challenging to implement at very high speeds. For example, probabilistic shaping often requires arithmetic coding to realize the target distribution. Geometric shaping…
Amplitude methods have proven to be a promising technique to perform Post-Minkowskian calculations used as inputs to construct gravitational waveforms. In this paper, we show how these methods can be extended beyond the standard…
Light shaping facilitates the preparation and detection of optical states and underlies many applications in communications, computing, and imaging. In this Letter, we generalize light shaping to the quantum domain. We show that patterns of…
The probabilistic shaping scheme from Honda and Yamamoto (2013) for polar codes is used to enable power-efficient signaling for on-off keying (OOK). As OOK has a non-symmetric optimal input distribution, shaping approaches that are based on…
A non-uniform channel input distribution is key for achieving the capacity of arbitrary channels. However, message bits are generally assumed to follow a uniform distribution which must first be transformed to a non-uniform distribution by…
How to achieve an arbitrary real-valued probability amplitude in the general single-partite or multipartite quantum system without measuring any other quantum state's probability amplitude? How to achieve an arbitrary real-valued…
A new geometric shaping technique, referred to as coset shaping, is proposed and analyzed for coded QAM and PAM signaling. This method can be applied to both information and parity bits without introducing additional complexity. It is shown…
We consider a nonlinear Fourier transform (NFT)-based transmission scheme, where data is embedded into the imaginary part of the nonlinear discrete spectrum. Inspired by probabilistic amplitude shaping, we propose a probabilistic eigenvalue…
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…
In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…
Probabilistic constellation shaping (PCS) offers a significant performance improvement over uniform signaling. It was recently discovered that long blocks are not required to achieve maximum shaping gain when transmitting over the nonlinear…
For black-hole binaries whose spins are (anti-) aligned with respect to the orbital angular momentum of the binary, we compute the frequency domain phasing coefficients including the quadratic-in-spin terms up to the third post-Newtonian…
A new probabilistic shaping distribution that outperforms Maxwell-Boltzmann is studied for the nonlinear fiber channel. Additional gains of 0.1 bit/symbol MI or 0.2 dB SNR for both DP-256QAM and DP-1024QAM are reported after 200 km…
Probabilistic constellation shaping (PCS) has been widely applied to amplified coherent optical transmissions owing to its shaping gain over the uniform signaling and fine-grained rate adaptation to the underlying fiber channel condition.…
First, a new proof of Berman and Charpin's characterization of the Reed-Muller codes over the binary field or over an arbitrary prime field is presented. These codes are considered as the powers of the radical of a modular algebra.…
The framework of non-extensive statistical mechanics, proposed by Tsallis, has been used to describe a variety of systems. The non-extensive statistical mechanics is usually introduced in a formal way, thus simple models exhibiting some…
Scalar quantization and probabilistic shaping are applied to the distributed source coding of Gaussian sources, with mean-square error distortion. A coding scheme with a modulo interval, dithering, and truncated Gaussian shaping is shown to…
We propose a QNSC pre-coding scheme based on probabilistic shaping of the basis, to reduce the probability of ciphertext bits that are easier to be intercepted. Experiment results show this scheme can improve the security performance by…
Unary coding is useful but it is redundant in its standard form. Unary coding can also be seen as spatial coding where the value of the number is determined by its place in an array. Motivated by biological finding that several neurons in…
The goal of combining beamforming and space-time coding in this work is to obtain full-diversity order and to provide additional received power (array gain) compared to conventional space-time codes. In our system, we consider a…