English
Related papers

Related papers: An error event sensitive trade-off between rate an…

200 papers

Because of their capacity-approaching performance, graph-based codes have a wide range of applications, including communications and storage. In these codes, unequal error protection (UEP) can offer performance gains with limited rate loss.…

Information Theory · Computer Science 2021-01-25 Beyza Dabak , Ahmed Hareedy , Alexei Ashikhmin , Robert Calderbank

In this paper, we consider the mismatched rate-distortion problem, in which the encoding is done using a codebook, and the encoder chooses the minimum-distortion codeword according to a mismatched distortion function that differs from the…

Information Theory · Computer Science 2022-12-20 Millen Kanabar , Jonathan Scarlett

We initiate a study of locally decodable codes with randomized encoding. Standard locally decodable codes are error correcting codes with a deterministic encoding function and a randomized decoding function, such that any desired message…

Information Theory · Computer Science 2020-01-14 Kuan Cheng , Xin Li , Yu Zheng

Diversity-multiplexing tradeoff (DMT) presents a compact framework to compare various MIMO systems and channels in terms of the two main advantages they provide (i.e. high data rate and/or low error rate). This tradeoff was characterized…

Information Theory · Computer Science 2016-11-15 Sergey Loyka , George Levin

For ergodic fading, a lattice coding and decoding strategy is proposed and its performance is analyzed for the single-input single-output (SISO) and multiple-input multiple-output (MIMO) point-to-point channel as well as the multiple-access…

Information Theory · Computer Science 2017-02-28 Ahmed Hindy , Aria Nosratinia

We propose iterative detection and decoding (IDD) algorithms with Low-Density Parity-Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems operating in block-fading and fast Rayleigh fading channels. Soft-input soft-output…

Information Theory · Computer Science 2016-11-17 André Uchoa , Cornelius T. Healy , Rodrigo C. de Lamare

Large number of antennas and radio frequency (RF) chains at the base stations (BSs) lead to high energy consumption in massive MIMO systems. Thus, how to improve the energy efficiency (EE) with a computationally efficient approach is a…

Information Theory · Computer Science 2020-10-28 Mangqing Guo , M. Cenk Gursoy

Many practical wireless communications systems select their transmit rate from a finite set of modulation and coding schemes, which correspond to a set of discrete rates. In this paper, we therefore formulate a joint coordinated precoding…

Information Theory · Computer Science 2016-04-20 Rasmus Brandt , Mats Bengtsson

In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay asymmetric space-time codes. Such codes are less than full dimensional lattices in their natural ambient space. Apart from the multiple…

Information Theory · Computer Science 2021-02-22 Roope Vehkalahti , Laura Luzzi

In this paper q-ary Raptor codes under ML decoding are considered. An upper bound on the probability of decoding failure is derived using the weight enumerator of the outer code, or its expected weight enumerator if the outer code is drawn…

Information Theory · Computer Science 2016-11-21 Francisco Lázaro , Gianluigi Liva , Enrico Paolini , Gerhard Bauch

Cross-layer scheduling is a promising way to improve Quality of Service (QoS) given a power constraint. In this paper, we investigate the system with random data arrival and adaptive transmission. Probabilistic scheduling strategies aware…

Information Theory · Computer Science 2016-11-18 Xiang Chen , Wei Chen

Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size $L$. Two asymptotic regimes are considered, the fixed list-size regime, where $L$ is fixed…

Information Theory · Computer Science 2016-11-17 Neri Merhav

The average symbol error probability (SEP) of a 1-bit quantized single-input multiple-output (SIMO) system is analyzed under Rayleigh fading channels and quadrature phase-shift keying (QPSK) modulation. Previous studies have partially…

Signal Processing · Electrical Eng. & Systems 2025-10-03 Amila Ravinath , Minhua Ding , Bikshapathi Gouda , Italo Atzeni , Antti Tölli

The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure channels [1], [2]. Remarkably, the proof does not rely on…

Information Theory · Computer Science 2016-07-12 Shrinivas Kudekar , Santhosh Kumar , Marco Mondelli , Henry D. Pfister , Rüdiger Urbanke

This paper presents a cross-layer approach for optimizing the delay performance of a multiuser diversity system with heterogeneous block-fading channels and a delay-sensitive bursty-traffic. We consider the downlink of a time-slotted…

Information Theory · Computer Science 2009-02-10 Jalil Seifali Harsini , Farshad Lahouti

In this work the optimal diversity-multiplexing tradeoff (DMT) is investigated for the multiple-input multiple-output fading multiple-access channels with no power constraints (infinite constellations). For K users (K>1), M transmit…

Information Theory · Computer Science 2015-05-22 Yair Yona , Meir Feder

In this paper we compute two important information-theoretic quantities which arise in the application of multiple-input multiple-output (MIMO) antenna wireless communication systems: the distribution of the mutual information of…

Information Theory · Computer Science 2010-07-06 Yang Chen , Matthew R. McKay

In this paper, a multi-hop (MH) decode-and-forward (DF) multiple-input multiple-output (MIMO) relay network has been studied. To consider a more realistic scenario, Full-Duplex (FD) operation with Relay Self-Interference (RSI) is employed.…

Information Theory · Computer Science 2015-04-15 G. F. Pivaro , G. Fraindenraich

Interleaved Reed-Solomon codes admit efficient decoding algorithms which correct burst errors far beyond half the minimum distance in the random errors regime, e.g., by computing a common solution to the Key Equation for each Reed-Solomon…

An index code for broadcast channel with receiver side information is locally decodable if each receiver can decode its demand by observing only a subset of the transmitted codeword symbols instead of the entire codeword. Local decodability…

Information Theory · Computer Science 2020-07-31 Lakshmi Natarajan , Prasad Krishnan , V. Lalitha , Hoang Dau