English
Related papers

Related papers: Optimal Index Coding with Min-Max Probability of E…

200 papers

We consider the maximum coding rate achievable by uniformly-random codes for the deletion channel. We prove an upper bound that's within 0.1 of the best known lower bounds for all values of the deletion probability $d,$ and much closer for…

Information Theory · Computer Science 2022-10-17 Berivan Isik , Francisco Pernice , Tsachy Weissman

The index coding problem is a fundamental transmission problem arising in content distribution and wireless networks. Traditional approach to solve this problem is to find heuristic/ approximation minimum clique partition solution on an…

Networking and Internet Architecture · Computer Science 2016-11-15 Jalaluddin Qureshi

In this paper, random coding error exponents and cutoff rate are studied for noncoherent Rician fading channels, where neither the receiver nor the transmitter has channel side information. First, it is assumed that the input is subject…

Information Theory · Computer Science 2016-11-18 Mustafa Cenk Gursoy

Interferences arising between wireless sensor-actuator systems communicating over shared wireless channels adversely affect closed loop control performance. To mitigate this problem we design appropriate channel access policies for wireless…

Optimization and Control · Mathematics 2018-10-30 Konstantinos Gatsis , Alejandro Ribeiro , George J. Pappas

Unreliable fading wireless channels are the main challenge for strict performance guarantees in mobile communications. Diversity schemes including massive number of antennas, huge spectrum bands and multi-connectivity links are applied to…

Information Theory · Computer Science 2020-09-21 Karl-Ludwig Besser , Eduard A. Jorswieck

A $K$-user memoryless interference channel is considered where each receiver sequentially decodes the data of a subset of transmitters before it decodes the data of the designated transmitter. Therefore, the data rate of each transmitter…

Information Theory · Computer Science 2016-11-15 Mohammad Ali Maddah-Ali , Hajar Mahdavi-Doost , Amir K. Khandani

The capacity of symmetric instance of the multiple unicast index coding problem with neighboring antidotes (side-information) with number of messages equal to the number of receivers was given by Maleki, Cadambe and Jafar. In this paper we…

Information Theory · Computer Science 2015-10-20 Mahesh Babu Vaddi , Roop Kumar Bhattaram , B. Sundar Rajan

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 proposes novel spectrum sensing algorithms for cognitive radio networks. By assuming known transmitter pulse shaping filter, synchronous and asynchronous receiver scenarios have been considered. For each of these scenarios, the…

Optimization and Control · Mathematics 2013-12-31 Tadilo Endeshaw Bogale , Luc Vandendorpe

Signal to Noise Ratio (SNR) is an important index for wireless communications. In CDMA systems, spreading sequences are utilized. This series of papers show the method to derive spreading sequences as the solutions of non-linear…

Information Theory · Computer Science 2016-12-30 Hirofumi Tsuda , Ken Umeno

Optimal decoding of bit interleaved coded modulation (BICM) MIMO-OFDM where an imperfect channel estimate is available at the receiver is investigated. First, by using a Bayesian approach involving the channel a posteriori density, we…

Networking and Internet Architecture · Computer Science 2007-08-13 Sajad Sadough , Pablo Piantanida , Pierre Duhamel

A novel inter-frame coding approach to the problem of varying channel-state conditions in broadcast wireless communication is developed in this paper; this problem causes the appropriate code-rate to vary across different transmitted frames…

Information Theory · Computer Science 2015-11-11 Hady Zeineddine , Mohammad M. Mansour

The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Input bits are deleted independently with probability d, and when they are not deleted, they are not affected by the channel.…

Information Theory · Computer Science 2011-05-02 Yashodhan Kanoria , Andrea Montanari

Content delivery networks often employ caching to reduce transmission rates from the central server to the end users. Recently, the technique of coded caching was introduced whereby coding in the caches and coded transmission signals from…

Information Theory · Computer Science 2016-02-16 Hooshang Ghasemi , Aditya Ramamoorthy

This paper focuses on a particular transmission scheme called local network coding, which has been reported to provide significant performance gains in practical wireless networks. The performance of this scheme strongly depends on the…

Networking and Internet Architecture · Computer Science 2015-03-17 Petteri Mannersalo , Georgios S. Paschos , Lazaros Gkatzikis

In this paper, we propose a methodology to compute the optimal finite-length coding rate for random linear network coding schemes over a line network. To do so, we first model the encoding, reencoding, and decoding process of different…

Networking and Internet Architecture · Computer Science 2018-05-16 Tan Do-Duy , M. Ángeles Vázquez-Castro

The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which can be easily implemented on most practical coded modulation…

Information Theory · Computer Science 2016-11-15 Pablo Piantanida , Sajad Sadough , Pierre Duhamel

A telecommunication system uses carriers in order to transmit information through a cable or wirelessly. If each time only one carrier is transmitted, then the system s signal will not be immune to frequency selective fading. If frequency…

Signal Processing · Electrical Eng. & Systems 2018-07-10 Spyridon K. Chronopoulos , Vasilis Christofilakis , Giorgos Tatsis , Panos Kostarakis

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

We address the problem of bounding below the probability of error under maximum likelihood decoding of a binary code with a known distance distribution used on a binary symmetric channel. An improved upper bound is given for the maximum…

Information Theory · Computer Science 2007-07-16 Alexander Barg , Andrew McGregor