English
Related papers

Related papers: Embedded Rank Distance Codes for ISI channels

200 papers

Rate and diversity impose a fundamental trade-off in communications. This trade-off was investigated for flat-fading channels in [15] as well as for Inter-symbol Interference (ISI) channels in [1]. A different point of view was explored in…

Information Theory · Computer Science 2009-12-24 S. Dusad , S. N. Diggavi

Rate and diversity impose a fundamental tradeoff in communications. This tradeoff was investigated for Intersymbol Interference (ISI) channels in [4]. A different point of view was explored in [1] where high-rate codes were designed so that…

Information Theory · Computer Science 2007-09-25 S. Dusad , S. N. Diggavi

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…

Information Theory · Computer Science 2017-05-30 Sven Puchinger , Sebastian Stern , Martin Bossert , Robert F. H. Fischer

Differential distributed space-time coding (D-DSTC) is a cooperative transmission technique that can improve diversity in wireless relay networks in the absence of channel information. Conventionally, it is assumed that channels are…

Information Theory · Computer Science 2014-11-18 M. R. Avendi , Hamid Jafarkhani

The rank metric measures the distance between two matrices by the rank of their difference. Codes designed for the rank metric have attracted considerable attention in recent years, reinforced by network coding and further motivated by a…

Information Theory · Computer Science 2022-03-24 Hannes Bartz , Lukas Holzbaur , Hedongliang Liu , Sven Puchinger , Julian Renner , Antonia Wachter-Zeh

The multiplicative-additive finite-field matrix channel arises as an adequate model for linear network coding systems when links are subject to errors and erasures, and both the network topology and the network code are unknown. In a…

Information Theory · Computer Science 2010-04-13 Roberto W. Nobrega , Bartolomeu F. Uchoa-Filho

Just as rank-metric or Gabidulin codes may be used to construct rate-diversity tradeoff optimal space-time codes, a recently introduced generalization for the sum-rank metric -- linearized Reed-Solomon codes -- accomplishes the same in the…

Information Theory · Computer Science 2021-03-10 Mohannad Shehadeh , Frank R. Kschischang

The stability of scheduled multiaccess communication with random coding and independent decoding of messages is investigated. The number of messages that may be scheduled for simultaneous transmission is limited to a given maximum value,…

Information Theory · Computer Science 2009-09-29 KCV Kalyanarama Sesha Sayee , Utpal Mukherji

We establish lower and upper bounds for the identification capacity of discrete-time Gaussian channels subject to inter-symbol interference (ISI), a canonical model in wireless communication. Our analysis accounts for deterministic encoders…

Information Theory · Computer Science 2026-05-04 Mohammad Javad Salariseddigh , Christian Deppe

In this paper, we investigate the design of linear precoders for multiple-input multiple-output (MIMO) multiple access channels (MAC). We assume that statistical channel state information (CSI) is available at the transmitters and consider…

Information Theory · Computer Science 2014-01-22 Yongpeng Wu , Chao-Kai Wen , Chengshan Xiao , Xiqi Gao , Robert Schober

Rank modulation is a way of encoding information to correct errors in flash memory devices as well as impulse noise in transmission lines. Modeling rank modulation involves construction of packings of the space of permutations equipped with…

Information Theory · Computer Science 2011-10-13 Arya Mazumdar , Alexander Barg , Gilles Zémor

The potential benefits of multiple-antenna systems may be limited by two types of channel degradations rank deficiency and spatial fading correlation of the channel. In this paper, we assess the effects of these degradations on the…

Information Theory · Computer Science 2007-07-13 Hyundong Shin , Moe Z. Win

This paper investigates the decoding of certain Gabidulin codes that were transmitted over a channel with space-symmetric errors. Space-symmetric errors are additive error matrices that have the property that their column and row spaces are…

Information Theory · Computer Science 2021-02-05 Thomas Jerkovits , Vladimir Sidorenko , Antonia Wachter-Zeh

In this paper, we consider the problem of polar coding for block fading channels, with emphasis on those with instantaneous channel state information (CSI) at neither the transmitter nor the receiver. Our approach is to decompose a block…

Information Theory · Computer Science 2017-01-24 Mengfan Zheng , Meixia Tao , Wen Chen , Cong Ling

We consider in this paper the design of full diversity and high rate space-time codes with moderate decoding complexity for arbitrary number of transmit and receive antennas and arbitrary input alphabets. We focus our attention to codes…

Information Theory · Computer Science 2010-01-21 Mohamed Oussama Damen , Hesham El Gamal , Ahmed A. Badr

This paper focuses on studying the fundamental performance limits and linear dispersion code design for the MIMO-ARQ slow fading channel. Optimal average rate of well-known HARQ protocols is analyzed. The optimal design of space-time coding…

Information Theory · Computer Science 2009-05-27 Cong Shen , Michael P. Fitz

This paper investigates the linear precoder design for $K$-user interference channels of multiple-input multiple-output (MIMO) transceivers under finite alphabet inputs. We first obtain general explicit expressions of the achievable rate…

Information Theory · Computer Science 2016-11-18 Yongpeng Wu , Chengshan Xiao , Xiqi Gao , John D. Matyjas , Zhi Ding

In this paper, we address the design of codes which achieve modulation diversity in block fading single-input single-output (SISO) channels with signal quantization at receiver and low-complexity decoding. With an unquantized receiver,…

Information Theory · Computer Science 2015-03-19 Saif Khan Mohammed , Emanuele Viterbo , Yi Hong , Ananthanarayanan Chockalingam

Fast-decodable distributed space-time codes are constructed by adapting the iterative code construction introduced in [1] to the N -relay multiple-input multiple-output channel, leading to the first fast-decodable distributed space-time…

Information Theory · Computer Science 2015-04-21 Amaro Barreal , Camilla Hollanti , Nadya Markin

The fundamental and natural connection between the infinite constellation (IC) dimension and the best diversity order it can achieve is investigated in this paper. In the first part of this work we develop an upper bound on the diversity…

Information Theory · Computer Science 2015-03-19 Yair Yona , Meir Feder
‹ Prev 1 2 3 10 Next ›