Related papers: Constructions of Optimal and Near-Optimal Quasi-Co…
We develop a theory based on quasi-geometric (QG) approach to transform a small number of qubits into a larger number of error-correcting qubits by considering four different cases. More precisely, we use the 2-dimensional quasi-orthogonal…
In this paper, we propose a semi-distributed cooperative spectrum sen sing (SDCSS) and channel access framework for multi-channel cognitive radio networks (CRNs). In particular, we c onsider a SDCSS scheme where secondary users (SUs)…
We introduce a construction to embed a quasiperiodic lattice of obstacles into a single unit cell of a higher-dimensional space, with periodic boundary conditions. This construction transparently shows the existence of channels in these…
For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to making short cycles. Also, the existing high-rate quasi-cyclic…
A quasi-complementary sequence set (QCSS) refers to a set of two-dimensional matrices with low non-trivial aperiodic auto- and cross- correlation sums. For multicarrier code-division multiple-access applications, the availability of large…
Non-Orthogonal Multiple Access (NOMA) is a concept which is gaining a big popularity in multiuser networks. It's due to its advantages in sense of total network throughput. It becomes especially significant in large networks such as…
We present quasi-diagonal preconditioners for piecewise polynomial discretizations of pseudodifferential operators of order minus two in any space dimension. Here, quasi-diagonal means diagonal up to a sparse transformation. Considering…
The integration of multicarrier modulation and multiple-input-multiple-output (MIMO) is critical for reliable transmission of wireless signals in complex environments, which significantly improve spectrum efficiency. Existing studies have…
We present a new family of one-coincidence sequence sets suitable for frequency hopping code division multiple access (FH-CDMA) systems with dispersed (low density) sequence elements. These sets are derived from one-coincidence prime…
The problem of three-user multiple-access channel (MAC) with noiseless feedback is investigated. A new coding strategy is presented. The coding scheme builds upon the natural extension of the Cover-Leung (CL) scheme; and uses quasi-linear…
The Multi-Carrier Code Division Multiple Access (MC-CDMA) is becoming a very significant downlink multiple access technique for high-rate data transmission in the fourth generation wireless communication systems. By means of efficient…
The everlasting bandwidth limitations in wireless communication networks has directed the researchers' thrust toward analyzing the prospect of overloaded Code Division Multiple Access (CDMA). In this paper, we have proposed a Genetic…
This paper studies networks with N half-duplex relays assisting the communication between a source and a destination. In ISIT'12 Brahma, \"{O}zg\"{u}r and Fragouli conjectured that in Gaussian half-duplex diamond networks (i.e., without a…
In this paper, we propose and evaluate two novel double-sequence low-resolution frequency synchronization methods in millimeter-wave (mmWave) systems. In our system model, the base station uses analog beams to send the synchronization…
The additive codes may have better parameters than linear codes. However, it is still a challenging problem to efficiently construct additive codes that outperform linear codes, especially those with greater distances than linear codes of…
In this paper, we study the optimal secondary-link beamforming pattern that balances between the SU's throughput and the interference it causes to PUs in MIMO cognitive radio networks. In particular, we aim to maximize the throughput of the…
The contributions of this paper are twofold: Firstly, we introduce a novel class of sequence pairs, called "cross Z-complementary pairs (CZCPs)", each displaying zero-correlation zone (ZCZ) properties for both their aperiodic…
Coded distributed computing (CDC) was introduced to greatly reduce the communication load for MapReduce computing systems. Such a system has $K$ nodes, $N$ input files, and $Q$ Reduce functions. Each input file is mapped by $r$ nodes and…
Barcoding photons can provide a host of functionalities that could benefit future quantum communication systems and networks beyond today's imagination. As a significant application of barcoding photons, we introduce code division…
Nearly convex sets play important roles in convex analysis, optimization and theory of monotone operators. We give a systematic study of nearly convex sets, and construct examples of subdifferentials of lower semicontinuous convex functions…