Related papers: Algebraic Distributed Differential Space-Time Code…
In this paper, we propose a new coding scheme and establish new bounds on the capacity region for the multi-sender unicast index-coding problem. We revisit existing partitioned Distributed Composite Coding (DCC) proposed by Sadeghi et al.…
This paper proposes a low decoding complexity, full-diversity and full-rate space-time block code (STBC) for 4 transmit and 2 receive ($4\times 2$) multiple-input multiple-output (MIMO) systems. For such systems, the best code known is the…
An adaptive joint power allocation (JPA) and linear receiver design algorithm using the minimum bit error rate (MBER) criterion for a cooperative Multiple-Input Multiple-Output (MIMO) network is proposed. The system employs multiple relays…
Consider a receiver in a multi-user network that wishes to decode several messages. Simultaneous joint typicality decoding is one of the most powerful techniques for determining the fundamental limits at which reliable decoding is possible.…
Space-time coding techniques have become common-place in wireless communication standards as they provide an effective way to mitigate the fading phenomena inherent in wireless channels. However, the use of Space-Time Block Codes (STBCs)…
We present a decode-and-forward transmission scheme based on spatially-coupled low-density parity-check (SC-LDPC) codes for a network consisting of two (possibly correlated) sources, one relay, and one destination. The links between the…
In this paper, we consider a space time block coded multiuser multiple-input multiple-output (MU-MIMO) system with downlink transmission. Specifically, we propose to use downlink precoding combined with differential modulation (DM) to shift…
Using the spatial modulation approach, where only one transmit antenna is active at a time, we propose two transmission schemes for two-way relay channel using physical layer network coding with space time coding using Coordinate…
We show that for (systematic) linear codes the time complexity of unique decoding is O(n^{2}q^{nRH(delta/2/R)}) and the time complexity of minimum distance decoding is O(n^{2}q^{nRH(delta/R)}). The proposed algorithm inspects all error…
This paper deals with physical layer network-coding for the four-way wireless relaying scenario where four nodes A, B, C and D wish to communicate their messages to all the other nodes with the help of the relay node R. The scheme given in…
A noisy network coding scheme for sending multiple sources over a general noisy network is presented. For multi-source multicast networks, the scheme naturally extends both network coding over noiseless networks by Ahlswede, Cai, Li, and…
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…
This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay network. Necessary conditions with cut-set interpretation are presented. A \emph{Joint source-Wyner-Ziv…
In various wireless systems, such as sensor RFID networks and body area networks with implantable devices, the transmitted signals are simultaneously used both for information transmission and for energy transfer. In order to satisfy the…
An efficient decoding algorithm named `divided decoder' is proposed in this paper. Divided decoding can be combined with any decoder using QR-decomposition and offers different pairs of performance and complexity. Divided decoding provides…
Physical layer network-coding for the $n$-way wireless relaying scenario is dealt with, where each of the $n$ user nodes $X_1,$ $X_2,...,X_n$ wishes to communicate its messages to all the other $(n-1)$ nodes with the help of the relay node…
We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2x2 and 4x2 multiple-input multiple-output (MIMO) transmission. We first derive conditions for reduced-complexity maximum-likelihood decoding, and apply them to a…
A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making…
It is well known that Space-Time Block Codes (STBCs) from orthogonal designs (ODs) are single-symbol decodable/symbol-by-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes…
Secret sharing schemes with optimal and universal communication overheads have been obtained independently by Bitar et al. and Huang et al. However, their constructions require a finite field of size q > n, where n is the number of shares,…