English
Related papers

Related papers: An algebraic look into MAC-DMT of lattice space-ti…

200 papers

The combination of space-time coding (STC) and continuous phase modulation (CPM) is an attractive field of research because both STC and CPM bring many advantages for wireless communications. Zhang and Fitz [1] were the first to apply this…

Information Theory · Computer Science 2008-12-18 Matthias Hesse , Jerome Lebrun , Luc Deneire

It is known that, for transmission over quasi-static MIMO fading channels with n transmit antennas, diversity can be obtained by using an inner fully diverse space-time block code while coding gain, derived from the determinant criterion,…

Information Theory · Computer Science 2010-08-10 Frederique Oggier , Patrick Sole , Jean-Claude Belfiore

The performance of the automatic repeat request-dynamic decode and forward (ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first scenario is the multiple access relay (MAR) channel where a single relay is dedicated…

Information Theory · Computer Science 2007-07-16 Kambiz Azarian , Hesham El Gamal , Philip Schniter

This paper studies the performance of transmission schemes that have rate that increases with average SNR while maintaining a fixed outage probability. This is in contrast to the classical Zheng-Tse diversity-multiplexing tradeoff (DMT)…

Information Theory · Computer Science 2007-10-09 Peng Wu , Nihar Jindal

A new Efficient-bandwidth code-division-multiple-access (CDMA) for band-limited channels is introduced which is based on finite field transforms. A multilevel code division multiplex exploits orthogonality properties of nonbinary sequences…

Information Theory · Computer Science 2015-05-18 H. M. de Oliveira , R. M. Campello de Souza , A. N. Kauffman

In this paper, new probability bounds are derived for algebraic lattice codes. This is done by using the Dedekind zeta functions of the algebraic number fields involved in the lattice constructions. In particular, it is shown how to upper…

Information Theory · Computer Science 2013-04-19 Camilla Hollanti , Emanuele Viterbo , David Karpuk

This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. In contrast to the standard approach in the literature which employs random…

Information Theory · Computer Science 2015-01-28 Laura Luzzi , Roope Vehkalahti

This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each…

Information Theory · Computer Science 2011-08-02 Ahmad Abu Al Haija , Mai Vu

Linear transceiving schemes between the relay and the destination have recently attracted much interest in MIMO amplify-and-forward (AF) relaying systems due to low implementation complexity. In this paper, we provide comprehensive analysis…

Information Theory · Computer Science 2014-03-11 Changick Song , Cong Ling

An adaptive delay-tolerant distributed space-time coding (DSTC) scheme with feedback is proposed for two-hop cooperative multiple-input multiple-output (MIMO) networks using an amplify-and-forward strategy and opportunistic relaying…

Information Theory · Computer Science 2014-12-16 T. Peng , R. C. de Lamare

This paper presents encoding and decoding algorithms for several families of optimal rank metric codes whose codes are in restricted forms of symmetric, alternating and Hermitian matrices. First, we show the evaluation encoding is the right…

Information Theory · Computer Science 2022-02-08 Wrya K. Kadir , Chunlei Li , Ferdinando Zullo

In a broadcast channel with random packet arrival and transmission queues, the stability of the system is achieved by maximizing a weighted sum rate capacity with suitable weights that depend on the queue size. The weighted sum rate…

Information Theory · Computer Science 2016-11-18 Lina Mroueh , Stéphanie Rouquette-Léveil , Ghaya Rekaya-Ben Othman , Jean-Claude Belfiore

Let $X=X(n,q)$ be the set of $n\times n$ Hermitian matrices over $\mathbb{F}_{q^2}$. It is well known that $X$ gives rise to a metric translation association scheme whose classes are induced by the rank metric. We study $d$-codes in this…

Combinatorics · Mathematics 2017-08-18 Kai-Uwe Schmidt

This paper proposes a novel joint non-binary network-channel code for the Time-Division Decode-and-Forward Multiple Access Relay Channel (TD-DF-MARC), where the relay linearly combines -- over a non-binary finite field -- the coded…

Information Theory · Computer Science 2016-11-15 Mikel Hernaez , Pedro M. Crespo , Javier Del Ser

We develop a framework to optimize the tradeoff between diversity, multiplexing, and delay in MIMO systems to minimize end-to-end distortion. We first focus on the diversity-multiplexing tradeoff in MIMO systems, and develop analytical…

Information Theory · Computer Science 2008-04-09 Tim Holliday , Andrea J. Goldsmith , H. Vincent Poor

This paper addresses the fundamental characteristics of information exchange via multihop network coding over two-way relaying in a wireless ad hoc network. The end-to-end rate regions achieved by time-division multihop (TDMH), MAC-layer…

Information Theory · Computer Science 2009-02-16 Chun-Hung Liu , Feng Xue , Jeffrey G. Andrews

This paper presents finite-blocklength achievability bounds for the Gaussian multiple access channel (MAC) and random access channel (RAC) under average-error and maximal-power constraints. Using random codewords uniformly distributed on a…

Information Theory · Computer Science 2022-05-05 Recep Can Yavas , Victoria Kostina , Michelle Effros

In this work, we explore the introduction of distributed space-time codes in decode-and-forward (DF) protocols. A first protocol named the Asymmetric DF is presented. It is based on two phases of different lengths, defined so that signals…

Information Theory · Computer Science 2008-11-05 Charlotte Hucher , Ghaya Rekaya-Ben Othman , Ahmed Saadani

We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space with the appropriate error ball. Some of the constructions…

Information Theory · Computer Science 2020-06-01 Hengjia Wei , Xin Wang , Moshe Schwartz

In the present paper we introduce and study finite point subsets of a special kind, called optimum distributions, in the n-dimensional unit cube. Such distributions are closely related with known (delta,s,n)-nets of low discrepancy. It…

Combinatorics · Mathematics 2007-07-16 M. M. Skriganov
‹ Prev 1 4 5 6 7 8 10 Next ›