Related papers: New Construction of Z-Complementary Code Sets and …
In this paper, we first propose a new design strategy of 2D $Z$-complementary array quads (2D-ZCAQs) with feasible array sizes. A 2D-ZCAQ consists of four distinct unimodular arrays satisfying zero 2D auto-correlation sums for non-trivial…
In this paper, we construct the first families of asymmetric quantum convolutional codes (AQCC)'s. These new AQCC's are constructed by means of the CSS-type construction applied to suitable families of classical convolutional codes, which…
Extended Boolean functions (EBFs) are one of the most important tools in cryptography and spreading sequence design in communication systems. In this paper, we use EBFs to design new sets of spreading sequences for non-orthogonal multiple…
We recently showed in [1] the superiority of certain structured coding matrices ensembles (such as partial row-orthogonal) for sparse superposition codes when compared with purely random matrices with i.i.d. entries, both…
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. The proposed decoder is designed in a such a way that the…
We present in this paper a new medium access control (MAC) scheme devoted to orthogonal frequency division multiple access (OFDMA) systems which aims at reducing collision probabilities during the channel request period. The proposed MAC…
We characterize group symmetries of poly-phase complementary code matrices (CCMs), which we use to classify CCMs in terms of their equivalence classes. We also present classification results for CCMs of dimension $N\times 4$ where…
Today's communication systems typically use high resolution analog-to-digital converters (ADCs). However, considering future communication systems with data rates in the order of 100Gbit/s the ADC power consumption becomes a major factor…
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain…
A new subcarrier combining technique is proposed for MC -CDMA receiver in mobile Rayleigh fading channel. It exploits the structure formed by repeating spreading sequences of users on different subcarriers to simultaneously suppress…
We consider the detection of correlated information sources in the ubiquitous Code-Division Multiple-Access (CDMA) scheme. We propose a message-passing based scheme for detecting correlated sources directly, with no need for source coding.…
We propose an adaptive lossy joint source-channel coding (JSCC) scheme for sending correlated sources over two-terminal discrete-memoryless two-way channels (DM-TWCs). The main idea is to couple the independent operations of the terminals…
The goal of this paper is to provide a rigorous information-theoretic analysis of subnetworks of interference networks. We prove two coding theorems for the compound multiple-access channel with an arbitrary number of channel states. The…
In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.
A new ensemble of structured codes is introduced. These codes are called Quasi Linear Codes (QLC). The QLC's are constructed by taking subsets of linear codes. They have a looser structure compared to linear codes and are not closed under…
We proposed a novel code called cyclic shift (CS) code to overcome the drawbacks exists in traditional Spectral Amplitude Coding- Optical Code Division Multiple Access (SAC-OCDMA) codes that have been presented in the past few years. The…
A new non-orthogonal multiple access scheme performing simultaneous transmission to multiple users characterized by different signal-to-noise ratios is proposed. Different users are multiplexed by storing their codewords into a multiplexing…
This paper studies coding schemes for the $q$-ary symmetric channel based on binary low-density parity-check (LDPC) codes that work for any alphabet size $q=2^m$, $m\in\mathbb{N}$, thus complementing some recently proposed packet-based…
Multiply constant-weight codes (MCWCs) have been recently studied to improve the reliability of certain physically unclonable function response. In this paper, we give combinatorial constructions for MCWCs which yield several new infinite…
Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual is trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault…