Related papers: Space-Time Codes from Spectral Norm: A Fresh Look
Space-time codes leverage the availability of multiple antennas to enhance the reliability of communication over wireless channels. While space-time codes have initially been designed with a focus on open-loop systems, recent technological…
We propose a new class of space-time block codes based on finite-field rank-metric codes in combination with a rank-metric-preserving mapping to the set of Eisenstein integers. It is shown that these codes achieve maximum diversity order…
Perfect space-time codes were first introduced by Oggier et. al. to be the space-time codes that have full rate, full diversity-gain, non-vanishing determinant for increasing spectral efficiency, uniform average transmitted energy per…
A new design method for high rate, fully diverse ('spherical') space frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary numbers of antennas and subcarriers. The construction exploits a differential geometric…
As wireless communication systems look intently to compose the transition from voice communication to interactive Internet data, achieving higher bit rates becomes both increasingly desirable and challenging. Space-time coding (STC) is a…
The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random…
The design of an Airwatch type space mission can greatly benefit from a flexible simulation code for establishing the values of the main parameters of the experiment. We present here a code written for this purpose. The cosmic ray primary…
This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $\eta_0$ to meet in order to be successfully decoded, and where this should occur within…
In the near future, the $5^{th}$ generation (5G) wireless systems will be established. They will consist of an integration of different techniques, including distributed antenna systems and massive multiple-input multiple-output systems,…
Subspace codes form the appropriate mathematical setting for investigating the Koetter-Kschischang model of fault-tolerant network coding. The Main Problem of Subspace Coding asks for the determination of a subspace code of maximum size…
A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and…
In this paper we consider a new normalization of matrices obtained by choosing distinct codewords at random from linear codes over finite fields and find that under some natural algebraic conditions of the codes their empirical spectral…
The most common decision criteria for decoding are maximum likelihood decoding and nearest neighbor decoding. It is well-known that maximum likelihood decoding coincides with nearest neighbor decoding with respect to the Hamming metric on…
In this paper, we propose two novel physical layer aware adaptive network coding and coded modulation schemes for time variant channels. The proposed schemes have been applied to different satellite communications scenarios with different…
Future communication scenarios for NASA spacecraft may involve multiple communication links and relay nodes, so that there is essentially a network in which there may be multiple paths from a sender to a destination. The availability of…
In this work, the Multiple transmit antennas Multiple Access Channel is considered. A construction of a family of distributed space-time codes for this channel is proposed. No Channel Side Information at the transmitters is assumed and…
We introduce two notions of discrepancy between binary vectors, which are not metric functions in general but nonetheless capture the mathematical structure of the binary asymmetric channel. In turn, these lead to two new fundamental…
Parity check matrices (PCMs) are used to define linear error correcting codes and ensure reliable information transmission over noisy channels. The set of codewords of such a code is the null space of this binary matrix. We consider the…
The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving…
In this work we propose an adaptive buffer-aided space-time coding scheme for cooperative wireless networks. A maximum likelihood receiver and adjustable code vectors are considered subject to a power constraint with an amplify-and-forward…