Sparse code multiple access (SCMA) is a class of non-orthogonal multiple access (NOMA)
that is proposed to support uplink machine-type communication services. In an SCMA …

We consider the problem of designing a sparse code multiple access (SCMA) codebook that
is based on permutation. Conventional SCMA is a multidimensional codebook-based non …

We derive new bounds on the aperiodic total squared correlation (ATSC) of binary antipodal
signature sets for any number of signatures K and any signature length L. We then present …

We derive new bounds on the periodic (cyclic) total squared correlation (PTSC) of binary
antipodal signature sets for any number of signatures K and any signature length L. Optimal …

In this paper, we consider the problem of recursively designing uniquely decodable ternary
code sets for highly overloaded synchronous code-division multiple-access (CDMA) …

In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code
sets for overloaded synchronous optical code-division multiple-access (O-CDMA) systems …

We consider the problem of designing a low-complexity decoder for antipodal uniquely
decodable (UD)/errorless code sets for overloaded synchronous code-division multiple …

Sparse code multiple access (SCMA) is a class of non-orthogonal multiple access that is
proposed to support uplink machine-type communication services. In this thesis, we …

In this paper, we consider the problem of designing uniquely decodable (UD) ternary code
sets for low-density spreading code-division multiple-access (LDS-CDMA) systems. The …

In overloaded CDMA systems the high correlation among users' signatures determines an
overall performace that can be quite poor even for the optimal ML receiver. The geometric …