Related papers: Geometrical relations between space time block cod…
We analyze a class of high performance, low decoding-data-flow error-correcting codes suitable for high bit-rate optical-fiber communication systems. A spatially-coupled split-component ensemble is defined, generalizing from the most…
High-rate space-time block codes (STBC with code rate > 1) in multi-input multi-output (MIMO) systems are able to provide both spatial multiplexing gain and diversity gain, but have high maximum likelihood (ML) decoding complexity. Since…
Quantum coherence and quantum correlations are of fundamental and practical significance for the development of quantum mechanics.They are also cornerstones of quantum computation and quantum communication theory. Searching physically…
In this paper, we propose a new design method of irregular spatially-coupled low-density parity-check (SC-LDPC) codes with non-uniform degree distributions by linear programming (LP). In general, irregular SC-LDPC codes with non-uniform…
The concept of spatial coupling is among the most significant breakthroughs in coding theory over the past decade. The excellent waterfall and error floor performance of spatially coupled codes has positioned them as promising coding…
We isolate a geometric mechanism that complements the dynamical suppression of macroscopic interference: In a high-dimensional Hilbert space, almost all state vectors are nearly orthogonal, accommodating an exponentially large reservoir of…
We investigate the level surfaces of geometric measure of quantum discord, and provide a pictorial interpretation of geometric discord for Bell-diagonal states. We have observed its nonanalytic behavior under decoherence employing this…
In this paper we propose a simple method for generating short-length rate-compatible codes over $\mathbb{Z}_M$ that are robust to non-coherent detection for $M$-PSK constellations. First, a greedy algorithm is used to construct a family of…
Complex orthogonal designs (CODs) play a crucial role in the construction of space-time block codes. Their real analog, real orthogonal designs (or equivalently, sum of squares composition formula) have a long history. Adams et al. (2011)…
Understanding brain function, constructing computational models and engineering neural prosthetics require assessing two problems, namely encoding and decoding, but their relation remains controversial. For decades, the encoding problem has…
We consider communication over channels whose statistics are not known in full, but can be parameterized as a finite family of memoryless channels. A typical approach to address channel uncertainty is to design codes for the worst channel…
We provide a novel framework to study subspace codes for non-coherent communications in wireless networks. To this end, an analog operator channel is defined with inputs and outputs being subspaces of $\mathbb{C}^n$. Then a certain distance…
Spatially-coupled (SC) LDPC codes have recently emerged as an excellent choice for error correction in modern data storage and communication systems due to their outstanding performance. It has long been known that irregular graph codes…
Full-rate space time codes (STC) with rate = number of transmit antennas have high multiplexing gain, but high decoding complexity even when decoded using reduced-complexity decoders such as sphere or QRDM decoders. In this paper, we…
We present a study on connection errors in networks of linear features and methods of error detection. We model networks with special connection specifications as networks with hierarchically connected features and define errors considering…
Quantum computing's potential for exponential speedup is fundamentally limited by decoherence, a phenomenon arising from environmental interactions. Non-Hermitian quantum mechanics, particularly $PT$-symmetric systems, offers a novel…
Spatially coupled codes have been of interest recently owing to their superior performance over memoryless binary-input channels. The performance is good both asymptotically, since the belief propagation thresholds approach capacity, as…
Coding for distributed computing supports low-latency computation by relieving the burden of straggling workers. While most existing works assume a simple master-worker model, we consider a hierarchical computational structure consisting of…
Time-symmetric integration schemes share with symplectic schemes the property that their energy errors show a much better behavior than is the case for generic integration schemes. Allowing adaptive time steps typically leads to a loss of…
Employing isomorphisms between their ambient rings, we propose new definitions of equivalence and isometry for skew polycyclic codes that will lead to tighter classifications than existing ones. This reduces the number of previously known…