Related papers: Recent Advances in Spatially Coupled Codes: Overvi…
In this paper, we propose a spatial coded modulation (SCM) scheme, which improves the accuracy of the active antenna detection by coding over the transmit antennas. Specifically, the antenna activation pattern in the SCM corresponds to a…
Geophysical models of the atmosphere and ocean invariably involve parameterizations. These represent two distinct areas: Subgrid processes that the model cannot resolve, and diabatic sources in the equations, due to radiation for example.…
Recently, a new class of error-control codes, the polar codes, have attracted much attention. The polar codes are the first known class of capacity-achieving codes for many important communication channels. In addition, polar codes have…
Quantum dense coding is one of the most important protocols in quantum communication. It derives from the idea of using quantum resources to boost the communication capacity and now serves as a key primitive across a variety of quantum…
Complete complementary codes (CCCs) are highly valuable in the fields of information security, radar and communication. The spectrally null constrained (SNC) problem arises in radar and modern communication systems due to the reservation or…
The MARS code is under continuous development and has recently undergone substantial improvements that further increase its reliability and predictive power in numerous shielding, accelerator, detector and space applications. The major…
Sparse coding (SC) is attracting more and more attention due to its comprehensive theoretical studies and its excellent performance in many signal processing applications. However, most existing sparse coding algorithms are nonconvex and…
For a given family of spatially coupled codes, we prove that the LP threshold on the BSC of the graph cover ensemble is the same as the LP threshold on the BSC of the derived spatially coupled ensemble. This result is in contrast with the…
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on lower and upper bounds for binary subspace codes for…
A promising research area that has recently emerged, is on how to use index coding to improve the communication efficiency in distributed computing systems, especially for data shuffling in iterative computations. In this paper, we posit…
In recent years, network coding has emerged as an innovative method that helps wireless network approaches its maximum capacity, by combining multiple unicasts in one broadcast. However, the majority of research conducted in this area is…
Compute-and-forward (CAF) relaying is effective to increase bandwidth efficiency of wireless two-way relay channels. In a CAF scheme, a relay is designed to decode a linear combination composed of transmitted messages from other terminals…
We formulate explicit predictions concerning the symmetry of optimal codes in compact metric spaces. This motivates the study of optimal codes in various spaces where these predictions can be tested.
We consider the problem of coding over the multi-user Interference Channel (IC). It is well-known that aligning the interfering signals results in improved achievable rates in certain setups involving more than two users. We argue that in…
Constant dimension codes are e.g. used for error correction and detection in random linear network coding, so that constructions for these codes have achieved wide attention. Here, we improve over 150 lower bounds by describing better…
The numerical conformal bootstrap has become in the last 15 years an indispensable tool for studying strongly coupled CFTs in various dimensions. Here we review the main developments in the field in the last 5 years, since the appearance of…
One of the most fundamental topics in subspace coding is to explore the maximal possible value ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$ such that the subspace distance satisfies $\operatorname{d_S}(U,V) =…
Electronic structure calculations have been instrumental in providing many important insights into a range of physical and chemical properties of various molecular and solid-state systems. Their importance to various fields, including…
Error-correcting codes and related combinatorial constructs play an important role in several recent (and old) results in computational complexity theory. In this paper we survey results on locally-testable and locally-decodable…
Code writing is repetitive and predictable, inspiring us to develop various code intelligence techniques. This survey focuses on code search, that is, to retrieve code that matches a given query by effectively capturing the semantic…