Related papers: Multilevel constructions: coding, packing and geom…
Recently, Venkatesh improved the best known lower bound for lattice sphere packings by a factor $\log\log n$ for infinitely many dimensions $n$. Here we prove an effective version of this result, in the sense that we exhibit, for the same…
The performance of constructive interference precoding (CIP) for multi-user multi-antenna (MU-MIMO) systems is governed by the structure of the constructive interference (CI) regions, yet this is overlooked in conventional constellation…
This paper introduces a new shape-matching methodology, combinative matching, to combine interlocking parts for geometric shape assembly. Previous methods for geometric assembly typically rely on aligning parts by finding identical surfaces…
In this paper, we propose to study and optimize a very general class of LDPC codes whose variable nodes belong to finite sets with different orders. We named this class of codes Hybrid LDPC codes. Although efficient optimization techniques…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
Mobile edge computing (MEC) is powerful to alleviate the heavy computing tasks in integrated sensing and communication (ISAC) systems. In this paper, we investigate joint beamforming and offloading design in a three-tier integrated sensing,…
Construction of high rate Space Time Block Codes (STBCs) with low decoding complexity has been studied widely using techniques such as sphere decoding and non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with M…
This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. In contrast to the standard approach in the literature which employs random…
An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…
In this paper, we shed light on how an adaptive, efficient error coding in the transport layer helps ensure the application requirements. We recap the use of MDS codes and show that binary coding can significantly reduce the complexity and…
A new polar coding scheme for higher order modulation is presented. The proposed scheme is based on multi-level coding (MLC) with natural labeling, where the bit-level corresponding to the sign-bit is generated in dependence on the previous…
Obtaining a rigorous and reliable method for linking computer simulations of polymer blends and composites at different length scales of interest is a highly desirable goal in soft matter physics. In this paper a multiscale modeling…
We present an alternative geometric representation for the eleven Archimedean lattices, in which each site and bond is uniquely labeled by an ordered pair of integers and characterized via a modular function. This structured labeling…
Spatially coupled low-density parity-check (SC-LDPC) codes are a class of capacity approaching LDPC codes with low message recovery latency when a sliding window decoding is used. In this paper, we first present a new method for the…
SC-LDPC codes with sub-block locality can be decoded locally at the level of sub-blocks that are much smaller than the full code block, thus providing fast access to the coded information. The same code can also be decoded globally using…
We investigate techniques for designing modulation/coding schemes for the wireless two-way relaying channel. The relay is assumed to have perfect channel state information, but the transmitters are assumed to have no channel state…
We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e.,…
Computer simulations serve as powerful tools for scientists and engineers to gain insights into complex systems. Less costly than physical experiments, computer experiments sometimes involve large number of trials. Conventional design…
Due to their fast decoding algorithms, quantum generalizations of low-density parity check, or LDPC, codes have been investigated as a solution to the problem of decoherence in fragile quantum states. However, the additional twisted inner…
Constant dimension codes (CDCs) are essential for error correction in random network coding. A fundamental problem of CDCs is to determine their maximal possible size for given parameters. Inserting construction and multilevel construction…