Related papers: Probabilistic Shaping and Non-Binary Codes
Convexity prior is one of the main cue for human vision and shape completion with important applications in image processing, computer vision. This paper focuses on characterization methods for convex objects and applications in image…
In previous work, we demonstrated how decoding of a non-binary linear code could be formulated as a linear-programming problem. In this paper, we study different polytopes for use with linear-programming decoding, and show that for many…
We implemented a flexible transmission system operating at adjustable data rate and fixed bandwidth, baudrate, constellation and overhead using probabilistic shaping. We demonstrated in a transmission experiment up to 15% capacity and 43%…
Using linear functional-based duality of modules, we generalize the syndrome decoding algorithm of linear codes over finite fields to those over finite commutative rings. Moreover, If the ring is local the algorithm is simplified by…
Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying certain conditions. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes…
This letter generalizes noise modulation by introducing two voltage biases and employing non-Gaussian noise distributions, such as Mixture of Gaussian (MoG) and Laplacian, in addition to traditional Gaussian noise. The proposed framework…
The Algebra of Physical Space (APS) is used to explore the Constructive Standard Model (CSM) of particle physics. Namely, this paper connects the spinor formalism of the APS to massive amplitudes in the CSM. A novel equivalency between…
Statistical Shape Modeling (SSM) is a quantitative method for analyzing morphological variations in anatomical structures. These analyses often necessitate building models on targeted anatomical regions of interest to focus on specific…
This paper applies probabilistic amplitude shaping (PAS) to a cyclic redundancy check (CRC) aided trellis coded modulation (TCM) to achieve the short-blocklength random coding union (RCU) bound. In the transmitter, the equally likely…
For the problem of binary linear classification and feature selection, we propose algorithmic approaches to classifier design based on the generalized approximate message passing (GAMP) algorithm, recently proposed in the context of…
Classical communication over lossy quantum channels is an essential topic in quantum information theory, with practical implications for optical-fiber and free-space communications. Multi-phase Hadamard codes, based on coherent-state Binary…
We show that short-length probabilistic shaping reduces nonlinear interference in optical fiber transmission. SNR improvements of up to 0.8 dB are obtained. The shaping gain vanishes when interleaving is employed and not undone before…
We present a novel and effective binary representation for convex shapes. We show the equivalence between the shape convexity and some properties of the associated indicator function. The proposed method has two advantages. Firstly, the…
Different aspects of probabilistic shaping for a multi-span optical communication system are studied. First, a numerical analysis of the additive white Gaussian noise (AWGN) channel investigates the effect of using a small number of input…
Extensions of singular spectrum analysis (SSA) for processing of non-rectangular images and time series with gaps are considered. A circular version is suggested, which allows application of the method to the data given on a circle or on a…
Recently we extended Approximate message passing (AMP) algorithm to be able to handle general invariant matrix ensembles. In this contribution we extend our S-AMP approach to non-linear observation models. We obtain generalized AMP (GAMP)…
Mean-field characterizations of first-order iterative algorithms -- including Approximate Message Passing (AMP), stochastic and proximal gradient descent, and Langevin diffusions -- have enabled a precise understanding of learning dynamics…
We analyze a probabilistic algorithm for matching shapes modeled by planar regions under translations and rigid motions (rotation and translation). Given shapes $A$ and $B$, the algorithm computes a transformation $t$ such that with high…
Recently, many good quantum codes over various finite fields $F_q$ have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly…
Error operator bases for systems of any dimension are defined and natural generalizations of the bit/sign flip error basis for qubits are given. These bases allow generalizing the construction of quantum codes based on eigenspaces of…