Related papers: Square Complex Orthogonal Designs with no Zero Ent…
Fast-decodable distributed space-time codes are constructed by adapting the iterative code construction introduced in [1] to the N -relay multiple-input multiple-output channel, leading to the first fast-decodable distributed space-time…
Binary self-orthogonal codes and balanced incomplete block designs are two combinatorial configurations that have been much studied because of their wide areas of application. In this paper, we have shown the distribution of (16; 6;…
Superconducting Quantum Interference Devices (SQUIDs), formed by incorporating Josephson junctions into loops of superconducting material, are the backbone of many modern quantum sensing systems. It has been demonstrated that, by combining…
We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process which adds the…
A circulant-based spatially-coupled (SC) code is constructed by partitioning the circulants in the parity-check matrix of a block code into several components and piecing copies of these components in a diagonal structure. By connecting…
Associative division algebras are a rich source of fully diverse space-time block codes (STBCs). In this paper the systematic construction of fully diverse STBCs from nonassociative algebras is discussed. As examples, families of fully…
This paper aims to provide a comprehensive solution for the design, analysis, and optimization of a multiple-antenna non-orthogonal multiple access (NOMA) system for multiuser downlink communication with both time duplex division (TDD) and…
In this paper, we first present the asymptotic performance of serially concatenated low-density generator-matrix (SCLDGM) codes for binary input additive white Gaussian noise channels using discretized density evolution (DDE). We then…
Non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) having large dimensions are attractive because they can simultaneously achieve both high spectral efficiencies (same spectral efficiency as in V-BLAST for a…
Self-orthogonal codes are of interest as they have important applications in quantum codes, lattices and many areas. In this paper, based on the weakly regular plateaued functions or plateaued Boolean functions, we construct a family of…
In this paper, we are concerned about optimal two-dimensional optical orthogonal codes with $\lambda$ = 2. Some combinatorial constructions are presented and many infinite families of optimal two-dimensional optical orthogonal codes with…
This paper presents a direct construction of an optimal symmetrical Z-complementary code set (SZCCS) of prime power lengths using a multi-variable function (MVF). SZCCS is a natural extension of the Z-complementary code set (ZCCS), which…
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…
Due to the zero nontrivial aperiodic correlation of complete complementary code (CCCs), it is used in asynchronous multi carrier code division multiple access (MC-CDMA) communication to provide zero interference performance. However, there…
This paper focuses on constructions for optimal $2$-D $(n\times m,3,2,1)$-optical orthogonal codes with $m\equiv 0\ ({\rm mod}\ 4)$. An upper bound on the size of such codes is established. It relies heavily on the size of optimal…
A subspace of a finite extension field is called a Sidon space if the product of any two of its elements is unique up to a scalar multiplier from the base field. Sidon spaces were recently introduced by Bachoc et al. as a means to…
Full-rate space-time block codes (STBCs) achieve high spectral-efficiency by transmitting linear combinations of information symbols through every transmit antenna. However, the coefficients used for the linear combinations, if not chosen…
The symbol-pair codes over finite fields have been raised for symbol-pair read channels and motivated by application of high-density data storage technologies [1, 2]. Their generalization is the code for b-symbol read channels (b > 2). Many…
Low decoding latency and complexity are two important requirements of channel codes used in many applications, like machine-to-machine communications. In this paper, we show how these requirements can be fulfilled by using some special…
We propose new constructions for a two-dimensional ($2$D) perfect array, complete complementary code (CCC), and multiple CCCs as an optimal symmetrical $Z$-complementary code set (ZCCS). We propose a method to generate a two-dimensional…